Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
chuckadams
on July 2, 2024
|
parent
|
context
|
favorite
| on:
Did Turing prove the undecidability of the halting...
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 :)
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: