News for hackers. Stuff that matters.
Re:Did Turing prove the undecidability of the halting problem? by afiori on Tuesday July 02, 2024 @04:01PM (#40859945)
With a little massaging of input and output you can convert any program P into the program P_n defined as "repeat P n times".

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.