About Strongly Universal Cellular Automata
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.
Main Author: | Maurice Margenstern |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2013-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1304.6316v2 |
Similar Items
-
A package of algorithms to devise cellular automata in the hyperbolic plane and related questions
by: Maurice Margenstern
Published: (2000-10-01) -
On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract)
by: Maurice Margenstern
Published: (2009-06-01) -
Learning About Growing Neural Cellular Automata
by: Sorana Catrina, et al.
Published: (2024-01-01) -
Cellular automata : a discrete universe /
by: 316810 Ilachinski, Andrew
Published: (2001) -
Two railway circuits: a universal circuit and an NP-difficult one
by: Maurice Margenstern
Published: (2001-05-01)