6 ms·
Sorry, you're right, yes. > Technically, a problem is called PSPACE-complete if it is equal in computational power to a particular mathematical model of compu
by dane-pgp 5y ago
Sorry, 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”).