Wikipedia
PSPACE
In computational complexity theory, is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.