Turing Tumble is P(SPACE)-complete

DOI10.1007/978-3-030-17402-6_23OpenAlexW2946720214MaRDI QIDQ2294057

Matthew P. Johnson

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17402-6_23

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other nonclassical models of computation (68Q09) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (1)

Turing Tumble is Turing-complete

This page was built for publication: Turing Tumble is P(SPACE)-complete