5 ms·
This paper repeatedly states that it’s PSPACE, but I see no evidence that it’s Turing complete.
by stellaathena 5y ago
This paper repeatedly states that it’s PSPACE, but I see no evidence that it’s Turing complete.
- dane-pgp 5y agoSorry, you're right, yes. > Technically, a problem is called PSPACE-complete if it is equal in computational power to a particular mathematical model of computation (called “polynomial-space-bounded Turing machines”).