Hacker News new | past | comments | ask | show | jobs | submit login

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.



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: