3 ms·
This might be it. Good catch. A machine that can perform all integer arithmetic operations (+, -, *) in constant time can solve all problems in PSPACE in polyno
by ogogmad 4y ago
This might be it. Good catch. A machine that can perform all integer arithmetic operations (+, -, *) in constant time can solve all problems in PSPACE in polynomial time.
- silasdavis 4y agoYes I think this is where NP is hiding.
- bodhiandphysics 4y agoWe’re lucky he didn’t claim p=PSPACE!