Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.


Paul Graham's brain is a nondeterministic Turing-machine.


NP-complete problems are for sissies. Paul Graham can solve any problem in the Arithmetic Hierarchy in O(1).


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.


All lambda expressions terminate in logarithmic time when evaluated in Paul Graham order.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: