Comment by isaacfrond
5 hours ago
Right. To be clear: the halting problem is not in the class NP. Any problem in NP can trivially be reduced to the halting problem and so the latter is NP-hard.
5 hours ago
Right. To be clear: the halting problem is not in the class NP. Any problem in NP can trivially be reduced to the halting problem and so the latter is NP-hard.
No comments yet
Contribute on Hacker News ↗