Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
PSPACE
open-in-new
Unsolved problem in computer science: P = ? P S P A C E {\displaystyle {\mathsf {P{\overset {?}{=}}PSPACE}}} <a href="/facts/List_of_unsolved_problems_in_computer_science/QySnBJ5E">(more unsolved problems in computer science)</a> <p>In <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a>, PSPACE is the set of all <a href="/facts/Decision_problem/cQNWjbdE">decision problems</a> that can be solved by a <a href="/facts/Turing_machine/ojCtglYu">Turing machine</a> using a <a href="/facts/Polynomial/Lzak8VVx">polynomial</a> <a href="/facts/Space_complexity/nsnAW5cV">amount of space</a>. </p>