Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
trixthethird
42 days ago
|
parent
|
context
|
favorite
| on:
The Halting Problem is a terrible example of NP-Ha...
This applies to any computable problem though, no? At minimum the verifier has to read the witness. If we ignore PCPs and such. The point here is that the witness grows very fast in terms of vector dimensionality and/or move set size.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: