Paul Graham is so good, his keyboard only has three keys: 0, 1 and Return. No Backspace, because he doesn't make mistakes.
Here's Paul while hacking:
Three keys are redundant.
Anything but the Church Numerals is below him.
Paul Graham can derive S from K
Sounds like we should have a Paul Graham Facts, like Chuck Norris.
Paul Graham's so smart that inside his brain is another brain.
Paul Graham once matched /(x+x+)+y/ in logarithmic time.
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.
All lambda expressions terminate in logarithmic time when evaluated in Paul Graham order.
Paul Graham is so good, he yelled at the hackernews server and it fixed itself.
Paul Graham is so good, he does not recurse. He uses the y combinator - in Continuation Passing Style - with both hands tied behind his back.
Paul Graham is so good, it's hard to defun him.