A universal cellular automaton on the heptagrid of the hyperbolic plane with four states
From MaRDI portal
Publication:616492
DOI10.1016/J.TCS.2010.04.015zbMath1207.68216OpenAlexW2084190811MaRDI QIDQ616492
Publication date: 10 January 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.015
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The domino problem of the hyperbolic plane is undecidable
- A universal cellular automaton in the hyperbolic plane.
- ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE
- Small Semi-Weakly Universal Turing Machines
- Surprising Areas in the Quest for Small Universal Devices
- A Universal Cellular Automaton on the Ternary Heptagrid
- NP problems are tractable in the space of cellular automata in the hyperbolic plane
This page was built for publication: A universal cellular automaton on the heptagrid of the hyperbolic plane with four states