News for hackers. Stuff that matters.
Re:The Halting Problem is a terrible example of NP-Harder by edanm on Thursday April 17, 2025 @05:22PM (#43722363)
I don't believe this is accurate.

The difference between NP-Hard and NP-Complete is that NP-Complete problems are both NP-Hard, and in NP. As opposed to NP-Hard problems that are not NP-Complete, meaning they are not themselves in NP.

There are no comments on this comment yet.