Turing Tumble is Turing-complete

DOI10.1016/J.TCS.2023.113734OpenAlexW3205891022MaRDI QIDQ2683507

Lenny Pitt

Publication date: 13 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.09343

zbMATH Keywords

computabilitymodels of computationTuring-completenessmarble-based computationTuring Tumble

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)

Cites Work

• Turing Tumble is P(SPACE)-complete

This page was built for publication: Turing Tumble is Turing-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2683507)