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

The Halting problem can already be solved for a non-trivial subset of programs, take a look at Microsoft Research's "Terminator" project:

http://research.microsoft.com/apps/mobile/news.aspx?post=/en...




But the halting problem for a subset of programs isn't The Halting Problem, which is the question whether a UTM can exist to calculate any function, over its entire domain.


The parent's wording was a little sloppy, but the point was that the grandparent was incorrectly using the Halting Problem to argue that you can't even do it for a meaningful subset of programs, which of course does not follow.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: