About Strongly Universal Cellular Automata
classification
💻 cs.DM
nlin.CG
keywords
cellularstronglyuniversalautomatahyperbolicstatesautomatonconstruct
read the original abstract
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and the standard neighbourhood. We embed this construction into several tilings of the hyperbolic plane and of the hyperbolic 3D space giving rise to strongly universal cellular automata with 10 states.
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.