Cellular automata and the humanities
β Scribed by Ernest Gallo
- Publisher
- Springer US
- Year
- 1994
- Tongue
- English
- Weight
- 618 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1042-1726
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We rewrite some concepts in the theory of one-dimensional periodic cellular automata in the language of finite fields. The state space of an automaton with N cell and q = pZ possible values for each cell (p prime) is identified with the finite field of qU elements, represented by means of a normal b
We study a classiΓΏcation of cellular automata based on the Turing degree of the orbits of the automaton. The di culty of determining the membership of a cellular automaton in any one of these classes is characterized in the arithmetical hierarchy.
Cellular automata (CA) do not find as wide a use in chemical complexity determined by a crystal structure as in homogeneous reacting systems. A reason for this is discussed, and a superposition of planigons and parallelogons or Wigner-Seitz tessellations is suggested that is derived from a crystallo