PSPACE

Unsolved problem in computer science

⁠${\displaystyle {\mathsf {P{\overset {?}{=}}PSPACE}}}$⁠

More unsolved problems in computer science

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