About Strongly Universal Cellular Automata
Discrete Mathematics
2013-09-09 v2 Cellular Automata and Lattice Gases
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.
Cite
@article{arxiv.1304.6316,
title = {About Strongly Universal Cellular Automata},
author = {Maurice Margenstern},
journal= {arXiv preprint arXiv:1304.6316},
year = {2013}
}
Comments
In Proceedings MCU 2013, arXiv:1309.1043