Target-Oriented Self-Structuring in Classifying Cellular Automata

Some cellular automata are able to solve classification problems on their initial configuration by building globally visible structures. However, no formal measures exist yet for describing or detecting this behavior in general. The lack of such formal methods often leads to quite observer-dependent discussions of emergent computation. In this paper, we propose the measures of target orientation and self-structuring that allow to formally evaluate a cellular automaton’s ability to solve a classification problem by emergent computation. By the means of these measures, globally emerging patterns can be recognized and their contribution to the solution of the classification problem can be judged in an observer-independent way.

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

[2]  M. Capcarrère.  Emergent computation in CA: A matter of visual efficiency? , 2008 .

[3]  M Mitchell,et al.  The evolution of emergent computation. , 1995, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  H. Fuks.  Solution of the density classification problem with two cellular automata rules , 1997, comp-gas/9703001.

[6]  Land,et al.  No perfect two-state cellular automata for density classification exists. , 1995, Physical review letters.

[7]  C. Shalizi,et al.  Causal architecture, complexity and self-organization in time series and cellular automata , 2001 .

[8]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[9]  Nino Boccara,et al.  Number-conserving cellular automaton rules , 1999, Fundam. Informaticae.

[10]  Paul W. Rendell,et al.  Turing Universality of the Game of Life , 2002, Collision-Based Computing.

[11]  James P. Crutchfield,et al.  Embedded-Particle Computation in Evolved Cellular Automata , 1996 .

[12]  Eric Goles Ch.,et al.  On conservative and monotone one-dimensional cellular automata and their particle representation , 2004, Theor. Comput. Sci..

[13]  M. Schreckenberg.  Modeling Complex Systems , 2004 .

[14]  Elwyn R. Berlekamp,et al.  Winning Ways for Your Mathematical Plays, Volume 2 , 2003 .

[15]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[16]  Capcarrere,et al.  Two-state, r=1 Cellular Automaton that Classifies Density. , 1996, Physical review letters.

[17]  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 .

[18]  Christian Müller-Schloer,et al.  Quantitative Emergence , 2006, 2006 IEEE Mountain Workshop on Adaptive and Learning Systems.

[19]  Hermann de Meer,et al.  On modeling of self-organizing systems , 2008, Autonomics 2008.

[20]  James P. Crutchfield,et al.  Computational mechanics of cellular automata: an example , 1997 .

[21]  Hermann de Meer,et al.  The Degree of Global-State Awareness in Self-Organizing Systems , 2009, IWSOS.

[22]  N. Boccara,et al.  Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules. , 1991, Physical review. A, Atomic, molecular, and optical physics.

[23]  Hermann de Meer,et al.  On Autonomy and Emergence in Self-Organizing Systems , 2008, IWSOS.

[24]  Pedro P. B. de Oliveira,et al.  Multiobjective evolutionary search for one-dimensional cellular automata in the density classification task , 2002 .