Paul Graham is a general algorithm to solve the halting program.
Paul Graham can solve NP-complete problems in polynomial time.
NP-complete problems are for sissies.
Paul Graham can solve any problem in the Arithmetic Hierarchy in O(1).
Re:YC News Unavailable...
by MasterOfLambdas on Friday September 28, 2007 @03:12PM
(#60763)
Matematicians searching for P=NP or P!=NP proof should wait until Paul Graham decides which of these statements is true.
It's a little known fact that the P in P=NP actually stands for Paul Graham.
Paul Graham's brain is a nondeterministic Turing-machine.
Paul Graham's so smart that inside his brain is another brain.
Paul Graham once matched /(x+x+)+y/ in logarithmic time.