411 REFERENCE · Wiktionary
PSPACE
Reference material by Wiktionary contributors. This retains its source identity and is not 411 news reporting.
English
Proper noun
en computability theory The set of all decision problems that can be solved by a Turing machine using an amount of memory which is a polynomial function of the input size.
en w:Michael Sipser Introduction to the Theory of Computation Boston, M.A. PWS Publishing Company 1997 313 https://archive.org/details/isbn_0534956513/page/313/mode/1up 0534956513 First, the hierarchy theorems tell us that a Turing machine can decide more languages in EXPSPACE than it can in PSPACE.
Further reading