Definition and Application of a Five-Parameter Characterization of One-Dimensional Cellular Automata Rule Space

Cellular automata (CA) are important as prototypical, spatially extended, discrete dynamical systems. Because the problem of forecasting dynamic behavior of CA is undecidable, various parameter-based approximations have been developed to address the problem. Out of the analysis of the most important parameters available to this end we proposed some guidelines that should be followed when defining a parameter of that kind. Based upon the guidelines, new parameters were proposed and a set of five parameters was selected; two of them were drawn from the literature and three are new ones, defined here. This article presents all of them and makes their qualities evident. Then, two results are described, related to the use of the parameter set in the Elementary Rule Space: a phase transition diagram, and some general heuristics for forecasting the dynamics of one-dimensional CA. Finally, as an example of the application of the selected parameters in high cardinality spaces, results are presented from experiments involving the evolution of radius-3 CA in the Density Classification Task, and radius-2 CA in the Synchronization Task.

[1]  Nizam Omar,et al.  Guidelines for dynamics-based parameterization of one-dimensional cellular automata rule spaces , 2000, Complex..

[2]  Wentian Li,et al.  Transition phenomena in cellular automata rule space , 1991 .

[3]  Binder Parametric ordering of complex systems. , 1993, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[4]  E. Jen Aperiodicity in one-dimensional cellular automata , 1991 .

[5]  H. Assa Set-Theoretic Reconstructability of Elementary Cellular Automata , 1995 .

[6]  Andrew Wuensche Complexity in One-D Cellular Automata: Gliders, Basins of Attraction and the Z Parameter , 1994 .

[7]  Melanie Mitchell,et al.  Evolving cellular automata to perform computations: mechanisms and impediments , 1994 .

[8]  Wentian Li,et al.  Phenomenology of nonlocal cellular automata , 1992 .

[9]  Melanie Mitchell,et al.  Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work , 2000 .

[10]  James P. Crutchfield,et al.  Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations , 1993, Complex Syst..

[11]  James P. Crutchfield,et al.  Evolving Globally Synchronized Cellular Automata , 1995, ICGA.

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  T. Czárán The global dynamics of cellular automata: by Andrew Wuensche and Mike Lesser, Addison-Wesley, 1992. £39.69 hbk (xvii + 250 pages) ISBN 0 201 55740 1 , 1993 .

[14]  E. F. Codd,et al.  Cellular automata , 1968 .

[15]  Andrew Wuensche,et al.  Classifying cellular automata automatically: Finding gliders, filtering, and relating space-time patterns, attractor basins, and the Z parameter , 1999, Complex..

[16]  Franco Bagnoli,et al.  Cellular Automata , 2002, Lecture Notes in Computer Science.

[17]  Stephen Wolfram,et al.  Cellular Automata And Complexity , 1994 .

[18]  Moshe Sipper,et al.  A Simple Cellular Automaton that Solves the Density and Ordering Problems , 1998 .

[19]  P.-M. Binder A Phase Diagram for Elementary Cellular Automata , 1993, Complex Syst..

[20]  Wentian Li,et al.  The Structure of the Elementary Cellular Automata Rule Space , 1990, Complex Syst..

[21]  Burton Voorhees Some Parameters Characterizing Cellular Automata Rules , 1997, Complex Syst..

[22]  M. Sipper Co-evolving non-uniform cellular automata to perform computations , 1996 .

[23]  F. H. Bennett,et al.  Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem , 1996 .

[24]  Christopher G. Langton,et al.  Computation at the edge of chaos: Phase transitions and emergent computation , 1990 .

[25]  John S. McCaskill,et al.  Open Problems in Artificial Life , 2000, Artificial Life.

[26]  J. Pollack,et al.  Coevolving the "Ideal" Trainer: Application to the Discovery of Cellular Automata Rules , 1998 .

[27]  Klaus Sutner,et al.  Computation theory of cellular automata , 1998 .

[28]  K. Culík,et al.  Computation theoretic aspects of cellular automata , 1990 .

[29]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .