News for hackers. Stuff that matters.

A comment on Why Philosophers Should Care About Computational Complexity. Parent comment

Re:Why Philosophers Should Care About Computational Complexity by vbtemp on Tuesday August 09, 2011 @12:12PM (#2864539)
How could undecidable problems possibly be a sub-set of NP-Hard problems? All the complexity classes fall within the realm of computable problems.
[ Parent | on HN ]

There are no comments on this comment yet.