Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
neilc
on Sept 28, 2007
|
parent
|
context
|
favorite
| on:
YC News Unavailable...
Paul Graham can solve NP-complete problems in polynomial time.
yinzhen
on Sept 28, 2007
|
next
[–]
Paul Graham's brain is a nondeterministic Turing-machine.
riffraff
on Sept 28, 2007
|
prev
[–]
NP-complete problems are for sissies. Paul Graham can solve any problem in the Arithmetic Hierarchy in O(1).
MasterOfLambdas
on Sept 28, 2007
|
parent
[–]
Matematicians searching for P=NP or P!=NP proof should wait until Paul Graham decides which of these statements is true.
icey
on Sept 28, 2007
|
root
|
parent
[–]
It's a little known fact that the P in P=NP actually stands for Paul Graham.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
