News for hackers. Stuff that matters.

A comment on YC News Unavailable.... Parent comment

Re:YC News Unavailable... by neilc on Friday September 28, 2007 @03:19AM (#60481)
Paul Graham can solve NP-complete problems in polynomial time.
[ Parent | on HN ]
Re:YC News Unavailable... by riffraff on Friday September 28, 2007 @01:33PM (#60698)
NP-complete problems are for sissies. Paul Graham can solve any problem in the Arithmetic Hierarchy in O(1).
[ Parent | on HN ]
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.
[ Parent | on HN ]
Re:YC News Unavailable... by icey on Friday September 28, 2007 @04:44PM (#60813)
It's a little known fact that the P in P=NP actually stands for Paul Graham.
[ Parent | on HN ]
Re:YC News Unavailable... by yinzhen on Friday September 28, 2007 @12:17PM (#60658)
Paul Graham's brain is a nondeterministic Turing-machine.
[ Parent | on HN ]