Re:Time Travel Simulation Resolves “Grandfather Paradox”
by evanb on Wednesday September 03, 2014 @10:44AM
(#8263212)
PSPACE is bigger than and contains NP. You still don't get ANYTHING=O(1), though.
https://en.wikipedia.org/wiki/NP_(complexity)#Relationship_t...
So for a time-travel computer to give P=NP or P=O(1), it would have to violate Deutsch's causality criterion. I have almost zero knowledge of either field, but it sounds to me like it makes Deutsch's model more plausible.