News for hackers. Stuff that matters.

A comment on Did Turing prove the undecidability of the halting problem?. Parent comment

Re:Did Turing prove the undecidability of the halting problem? by Rhapso on Tuesday July 02, 2024 @11:49AM (#40857820)
There is 1 general way to show any given program halts. Run it on each equivalency class of input and wait!

This just might take forever.

[ Parent | on HN ]
Re:Did Turing prove the undecidability of the halting problem? by anon291 on Tuesday July 02, 2024 @05:11PM (#40860464)
That is not a determinable way though, since when a program enters a 'loop'ing state, it's unclear if it's going to halt or not.
[ Parent | on HN ]
Re:Did Turing prove the undecidability of the halting problem? by Rhapso on Tuesday July 02, 2024 @05:40PM (#40860687)
it was unclear the entire runtime. Just need to keep evaluating.
[ Parent | on HN ]