2 ms·
Paul Graham is a general algorithm to solve the halting program.
by rms 19y ago
Paul Graham is a general algorithm to solve the halting program.
- neilc 19y agoPaul Graham can solve NP-complete problems in polynomial time.
- yinzhen 19y agoPaul Graham's brain is a nondeterministic Turing-machine.
- riffraff 19y agoNP-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.