Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
taejo
on Dec 4, 2013
|
parent
|
context
|
favorite
| on:
P = NP
Turing machines have may have infinite memory, but they can also only write one step per cell. So a polynomial-time TM can't use superpolynomial memory.
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: