Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
vbtemp
on Aug 9, 2011
|
parent
|
context
|
favorite
| on:
Why Philosophers Should Care About Computational C...
How could undecidable problems possibly be a sub-set of NP-Hard problems? All the complexity classes fall within the realm of computable problems.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
