11–18 of 18 posts
Obligatory mention that although Halt doesn’t exist for arbitrary P, there are Halt_N for every natural N where Halt_N works on empty-input TMs with at most N states. Undecidability is more about compression than it is about whether we can determine if TMs halt.
(The N required depends on your axioms.)
The halting problem--a tough endeavor "Will the loop complete or run forever?" Many fixes were attempted (Lambda's 15 minute limit doesn't get exempted) You'll quickly find there is no winning As the LOADING ball keeps spinning To date there remains a single hack: Rip the cable out the back You'll have an answer clarified: "The loop is done; the power died."
Scooping the Loop Snooper (2000) - https://news.ycombinator.com/item?id=30783422 - March 2022 (31 comments)
Scooping the Loop Snooper: Proof That the Halting Problem Is Undecidable (2000) - https://news.ycombinator.com/item?id=20956756 - Sept 2019 (33 comments)
Scooping the Loop Snooper (2000) - https://news.ycombinator.com/item?id=10077471 - Aug 2015 (2 comments)
The halting problem--a tough endeavor "Will the loop complete or run forever?" Many fixes were attempted (Lambda's 15 minute limit doesn't get exempted) You'll quickly find there is no winning As the LOADING ball keeps spinning To date there remains a single hack: Rip the cable out the back You'll have an answer clarified: "The loop is done; the power died."
...this comment made a lot more sense when the title was "a poem about the halting problem." Now I just look more deranged than I usually do.