▲
Hacker News
new
|
best
|
ask
|
show
|
jobs
points by
isaacfrond
2 days ago | 0 comments
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.
Aún no hay comentarios.
Hacker News