2 ms·
NP-complete problems are for sissies. Paul Graham can solve any problem in the Arithmetic Hierarchy in O(1).
by riffraff 19y ago
NP-complete problems are for sissies.
Paul Graham can solve any problem in the Arithmetic Hierarchy in O(1).
- MasterOfLambdas 19y agoMatematicians searching for P=NP or P!=NP proof should wait until Paul Graham decides which of these statements is true.
- icey 19y agoIt's a little known fact that the P in P=NP actually stands for Paul Graham.