80 research outputs found
Introduction to Rule 110
A brief introduction to the study of the cellular automaton Rule 110 is presented. We begin with a general historical background of cellular automata theory, discussing the most important stages of development. Later we show the antecedents in the study of Rule 110, making special emphasis in the conjecture of Stephen Wolfram and the results of Matthew Cook. Finally we develop a relation between the models of John von Neumann, John Horton Conway and Cook, discussing important problems in cellular automata theory
On generative morphological diversity of elementary cellular automata
Purpose: Studies in complexity of cellular automata do usually deal with measures taken on integral dynamics or statistical measures of space-time configurations. No one has tried to analyze a generative power of cellular-automaton machines. The purpose of this paper is to fill the gap and develop a basis for future studies in generative complexity of large-scale spatially extended systems. Design/methodology/approach: Let all but one cell be in alike state in initial configuration of a one-dimensional cellular automaton. A generative morphological diversity of the cellular automaton is a number of different three-by-three cell blocks occurred in the automaton's space-time configuration. Findings: The paper builds a hierarchy of generative diversity of one-dimensional cellular automata with binary cell-states and ternary neighborhoods, discusses necessary conditions for a cell-state transition rule to be on top of the hierarchy, and studies stability of the hierarchy to initial conditions. Research limitations/implications: The method developed will be used - in conjunction with other complexity measures - to built a complete complexity maps of one- and two-dimensional cellular automata, and to select and breed local transition functions with highest degree of generative morphological complexity. Originality/value: The hierarchy built presents the first ever approach to formally characterize generative potential of cellular automata. © Emerald Group Publishing Limited
Designing complex dynamics in cellular automata with memory
Since their inception at Macy conferences in later 1940s, complex systems have remained the most controversial topic of interdisciplinary sciences. The term "complex system" is the most vague and liberally used scientific term. Using elementary cellular automata (ECA), and exploiting the CA classification, we demonstrate elusiveness of "complexity" by shifting space-time dynamics of the automata from simple to complex by enriching cells with memory. This way, we can transform any ECA class to another ECA class - without changing skeleton of cell-state transition function - and vice versa by just selecting a right kind of memory. A systematic analysis displays that memory helps "discover" hidden information and behavior on trivial - uniform, periodic, and nontrivial - chaotic, complex - dynamical systems. © World Scientific Publishing Company
Complex dynamics emerging in Rule 30 with majority memory
In cellular automata with memory, the unchanged maps of the conventional
cellular automata are applied to cells endowed with memory of their past states
in some specified interval. We implement Rule 30 automata with a majority
memory and show that using the memory function we can transform quasi-chaotic
dynamics of classical Rule 30 into domains of travelling structures with
predictable behaviour. We analyse morphological complexity of the automata and
classify dynamics of gliders (particles, self-localizations) in memory-enriched
Rule 30. We provide formal ways of encoding and classifying glider dynamics
using de Bruijn diagrams, soliton reactions and quasi-chemical representations
- …