𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A complexity analysis of the elementary cellular automaton of rule 122

✍ Scribed by Zhisong Jiang

Publisher
Springer
Year
2001
Tongue
English
Weight
111 KB
Volume
46
Category
Article
ISSN
1001-6538

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The constructibility of a configuration
The constructibility of a configuration in a cellular automaton
✍ Takeo Yaku πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 640 KB

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

Generalized sub-shifts in elementary cel
Generalized sub-shifts in elementary cellular automata: the β€œstrange case” of chaotic rule 180
✍ Gianpiero Cattaneo; Luciano Margara πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 924 KB

We study the dynamical behavior of elementary cellular automaton 180. This rule gives rise to a global dynamics on the phase space of all one-dimensional bi-infinite configurations which is Devaney topologically chaotic. The dense sub-dynamical system of configurations in background of OS is a gener