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

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.




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

Search: