A weakly universal cellular automaton on the pentagrid with three states
classification
💻 cs.DM
nlin.CG
keywords
statesautomatoncellularpentagridthreeuniversalweaklyalways
read the original abstract
In this paper, we prove that there is a weakly universal cellular automaton on the pentagrid with three states which is rotation invariant and which uses \`a la Moore neighbourhood. Moreover, at each step of the computation, the set of non quiescent states has always infinitely many cycles.
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.