Recognizing the repeatable configurations of time-reversible generalized Langton's ant is PSPACE-hard
From MaRDI portal
(Redirected from Publication:1736474)
Recommendations
Cites work
- Complexity of Langton's ant
- Diffusion in Lorentz lattice gas cellular automata: the honeycomb and quasi-lattices compared with the square and triangular lattices
- scientific article; zbMATH DE number 426410 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1178990 (Why is no real title available?)
- Recurrence properties of Lorentz lattice gas cellular automata
- Rotators, periodicity, and absence of diffusion in cyclic cellular automata
Cited in
(5)- Complexity of Langton's ant
- PSPACE-completeness of reversible deterministic systems
- scientific article; zbMATH DE number 1689044 (Why is no real title available?)
- PSPACE-completeness of reversible deterministic systems
- Agent motion planning as block asynchronous cellular automata: pushing, pulling, suplexing, and more
This page was built for publication: Recognizing the repeatable configurations of time-reversible generalized Langton's ant is PSPACE-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736474)