EXPSPACE

Complexity classes

In computational complexity theory, EXPSPACE is the set of all decision problems solvable by a deterministic Turing machine in exponential space, i.e., in space, where is a polynomial function of . Some authors restrict to be a linear function, but most authors instead call the resulting class ESPACE. If we use a nondeterministic machine instead, we get the class NEXPSPACE, which is equal to EXPSPACE by Savitch's theorem. A decision problem is EXPSPACE-complete if it is in EXPSPACE, and every problem in EXPSPACE has a polynomial-time many-one reduction to it. In other words, there is a polynomial-time algorithm that transforms instances of one to instances of the other with the same answer. EXPSPACE-complete problems might be thought of as the hardest problems in EXPSPACE. EXPSPACE is a strict superset of PSPACE, NP, and P and is believed to be a strict superset of EXPTIME. (Wikipedia).

exploratorium: an exhibition with strobo

From playlist Exploratorium through your eyes

Free & Fun Learning Resources from the Exploratorium

Keep kids inspired and find support for your virtual classroom with the Exploratorium’s free and fun educational resources. Stay curious and keep exploring, no matter what school looks like this year. → Explore more at www.exploratorium.edu/learn -- The Exploratorium is a non-profit mus

From playlist Teaching and Learning | Exploratorium