A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every conΓΏguration has at most one predecessor. Margolus showed that there is a computation-universal two-dimensional 2-state RCA. But his RCA has a non-uniform neighbor, so Morita and Ueno prop
A universal cellular automaton in the hyperbolic plane
β Scribed by Francine Herrmann; Maurice Margenstern
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 876 KB
- Volume
- 296
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
The paper gives the construction of a universal CA with 22 states in the regular rectangular pentagonal grid of the hyperbolic plane. The CA implements a railway circuit which simulates a register machine and which improves a bit already known railway simulations of a Turing machine.
π SIMILAR VOLUMES
A configuration is said to be with finite support if the states of all but finitely many cells in the array are quiescent. The results are as follows. It is recursively unsolvable when d > 2, for a configuration c with finite support in a d-dimensional cellular automaton, whether or not: 1. c is in
A cellular automaton (CA) is constructed for the formation of the central nervous system of the Drosophila embryo. This is an experimentally well-studied system in which complex interactions between neighbouring cells appear to drive their differentiation into different types. It appears that all th