Re:Did Turing prove the undecidability of the halting problem?
by chuckadams on Tuesday July 02, 2024 @10:21AM
(#40856993)
I actually like the symbol phrasing, it's more general than halting. You can't prove that any arbitrary program that can be in state X will ever actually reach state X. Besides, I feel like https://xkcd.com/1266/ is relevant :)
[ Parent
| on HN ]
There are no comments on this comment yet.