Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
anon291
70 days ago
|
parent
|
context
|
favorite
| on:
Did Turing prove the undecidability of the halting...
> Figuring out whether a single given program halts is decidable
Whether
any
single given program? No, it's not decidable. For many programs, sure.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Whether any single given program? No, it's not decidable. For many programs, sure.