Abstract: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 (particle, self-localizations… Show more
Since their inception at Macy conferences in later 1940s complex systems remain the most controversial topic of inter-disciplinary 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 display that memory helps 'discover' hidden information and behaviour on trivialuniform, periodic, and non-trivial -chaotic, complex -dynamical systems.
Since their inception at Macy conferences in later 1940s complex systems remain the most controversial topic of inter-disciplinary 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 display that memory helps 'discover' hidden information and behaviour on trivialuniform, periodic, and non-trivial -chaotic, complex -dynamical systems.
“…In this way, Rule 126 provides a special case of how a chaotic behavior can be decomposed selecting a kind of memory into a extraordinary activity of gliders, glider guns, still-life structures, and a huge number of reactions. Such features can be compared to Brain Brian's rule behavior or Conway's Life but in one dimension; actually none traditional ECA could have a glider dynamics comparable to the one revealed in this ECA with memory denoted as φ R126maj (following notation described in [7,8]).…”
Section: Introductionmentioning
confidence: 87%
“…As it was explained in [7,37] a new family of evolution rules derived from classic ECA can be found selecting a kind of memory. Figure 9 illustrates dynamics for some values of τ in φ R126maj .…”
Section: Dynamics Emerging With Majority Memorymentioning
confidence: 99%
“…Such technique takes the past history of the system for constructing its present and future: the memory [1][2][3][4][5][6]. It was previously reported in [7] how the chaotic elementary cellular automaton (ECA) Rule…”
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system -when enriched with memory -hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced from original information of the ahistorical system. First we analyse classic ECA Rule 126 to identify basic characteristics with mean field theory, basins, and de Bruijn diagrams. In order to derive this complex dynamics, we use a kind of memory on Rule 126; from here interactions between gliders are studied for detecting stationary patterns, glider guns and simulating specific simple computable functions produced by glider collisions.
An elementary cellular automaton with memory is a chain of finite state machines (cells) updating their state simultaneously and by the same rule. Each cell updates its current state depending on current states of its immediate neighbours and a certain number of its own past states. Some cellstate transition rules support gliders, compact patterns of non-quiescent states translating along the chain. We present designs of logical gates, including reversible Fredkin gate and controlled not gate, implemented via collisions between gliders.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.