3 ms·

Paul Graham can solve NP-complete problems in polynomial time.

• yinzhen 19y ago
  Paul Graham's brain is a nondeterministic Turing-machine.
• riffraff 19y ago
  NP-complete problems are for sissies. Paul Graham can solve any problem in the Arithmetic Hierarchy in O(1).
  • MasterOfLambdas 19y ago
    Matematicians searching for P=NP or P!=NP proof should wait until Paul Graham decides which of these statements is true.
    • icey 19y ago
      It's a little known fact that the P in P=NP actually stands for Paul Graham.