A new universal cellular automaton on the ternary heptagrid
classification
💻 cs.FL
cs.CG
keywords
cellularautomatonheptagridresultstatesternaryuniversalauthor
read the original abstract
In this paper, we construct a new weakly universal cellular automaton on the ternary heptagrid. The previous result, obtained by the same author and Y. Song required six states only. This time, the number of states is four. This is the best result up to date for cellular automata in the hyperbolic plane.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.