Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
gcr
on Dec 29, 2013
|
parent
|
context
|
favorite
| on:
Bogo-bogosort
Why not just pass it to an infinite number of processors and use a nondeterministic Turing machine?
But with an NDTM, even NP-complete problems can be solved within polynomial time.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
But with an NDTM, even NP-complete problems can be solved within polynomial time.