Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Groxx
on May 6, 2010
|
parent
|
context
|
favorite
| on:
How Dr. Seuss would prove the halting problem unde...
Good point. But that doesn't mean it's useless. Check it with an external P: If it's a paradoxical process like is given in the proof, it won't finish, which will be detected, uniquely, as a paradox because it won't halt.
argv_empty
on May 6, 2010
[–]
For what finite number of steps can we watch the program and know afterwards that it will never halt in the future?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: