Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Did Turing prove the undecidability of the halting problem?. Parent comment
For any n P terminate if and only if P_n terminates, so no general procedure can decide the halting problem for all programs except 1.
There are no comments on this comment yet.
For any n P terminate if and only if P_n terminates, so no general procedure can decide the halting problem for all programs except 1.