3 ms·
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.micro
by jahewson 11y ago
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-us/news/features/terminator.aspx http://research.microsoft.com/apps/mobile/news.aspx?post=/en...
- kazinator 11y agoBut 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.
- dllthomas 11y agoThe 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.