Re:Church-Turing Thesis Cannot Possibly Be True [video]
by olliej on Friday October 19, 2018 @12:41PM
(#18257944)
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.
[ Parent
| on HN ]
There are no comments on this comment yet.