NP problems are tractable in the space of cellular automata in the hyperbolic plane
Theoretical Computer Science
A universal cellular automaton in the hyperbolic plane
Theoretical Computer Science
Cellular automata and combinatoric tilings in hyperbolic spaces: a survey
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane
Electronic Notes in Theoretical Computer Science (ENTCS)
Universal cellular automata in the hyperbolic spaces
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states
Theoretical Computer Science
An algorithmic approach to tilings of hyperbolic spaces: 10 years later
CMC'10 Proceedings of the 11th international conference on Membrane computing
A new weakly universal cellular automaton in the 3D hyperbolic space with two states
RP'11 Proceedings of the 5th international conference on Reachability problems
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Ten years of weakly universal cellular automata in the hyperbolic plane
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
| Hi-index | 0.00 |
In this paper, we construct the first weakly universal cellular automaton on the ternary heptagrid. It requires six states only. It provides a universal automaton with less states than in the case of the pentagrid where the best result is nine states, a result also recently established by the authors.