<span class="searchmatch">PSPACE</span> (computing 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...
First, the hierarchy theorems tell us that a Turing machine can decide more languages in EXPSPACE than it can in <span class="searchmatch">PSPACE</span>. EXPSPACE on Wikipedia.Wikipedia...
that a Turing machine can decide more languages in EXPSPACE than it can in <span class="searchmatch">PSPACE</span>. (obsolete) To cut off; to separate. 1642, Thomas Fuller, The Holy State...