Producción Científica Profesorado

How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study



Seck Tuoh Mora, Juan Carlos

2010

Martínez, G. J., Adamatzky A., Seck-Tuoh-Mora J. C., Alonso-Sanz R. (2010). How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study. Complexity, 15(6), 34-49.


Abstract


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 analyze classic ECA Rule 126 to identify basic characteristics with mean field theory, basins, and de Bruijn diagrams. 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.



Producto de Investigación




Artículos relacionados

How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study

Unconventional invertible behaviors in reversible one-dimensional cellular automata.

Complex Dynamics Emerging in Rule 30 with Majority Memory

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

On explicit inversion of a subclass of operators with D-difference kernels and Weyl theory of the co...

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

Elementary cellular automaton Rule 110 explained as a block substitution system

Reproducing the Cyclic Tag System Developed by Matthew Cook with Rule 110 Using the Phases f(i-)1.