Re:Accidentally Turing-Complete
by dane-pgp on Saturday February 05, 2022 @11:58AM
(#30223038)
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”).
> 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”).