About Strongly Universal Cellular Automata
Maurice Margenstern · Electronic Proceedings in Theoretical Computer Science · 2013
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.