Hacker News new | ask | show | jobs
by ogogmad 1402 days 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.
1 comments

Yes I think this is where NP is hiding.
We’re lucky he didn’t claim p=PSPACE!