Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Chance-Device
3 months ago
|
parent
|
context
|
favorite
| on:
You are the scariest monster in the woods
Who says that we don’t? The point is that the bounds on the question are completely unknown, and we operate on the assumption that the compute time is relatively short. Do we have any empirical basis for this? I think we do not.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: