Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
olliej
on Oct 19, 2018
|
parent
|
context
|
favorite
| on:
Church-Turing Thesis Cannot Possibly Be True [vide...
The problem is that because it’s random there is a chance it will never complete, so the same input alternates between halting and non-halting, so the average time is infinite. Which is clearly nonsensical, hence it isn’t an algorithm.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: