Schema redescription in cellular automata: Revisiting emergence in complex systems

We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of individual input variables, and another to capture permutability in sets of input variables: fully characterizing the canalization present in Boolean functions. Two-symbol schemata explain aspects of the behaviour of automata networks that the characterization of their emergent patterns does not capture. We use our method to compare two well-known cellular automata rules for the density classification task [1]: GKL [2], [3] and GP [4]. We show that despite having very different emergent behaviour, these rules are very similar. Indeed, GKL is a special case of GP. Therefore, we demonstrate that it is more feasible to compare cellular automata via schema redescriptions of their rules, than by looking at their emergent behaviour, leading us to question the tendency in complexity research to pay much more attention to emergent patterns than to local (micro-level) interactions.

[1]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[2]  Pedro P. B. de Oliveira,et al.  Very Effective Evolutionary Techniques for Searching Cellular Automata Rule Spaces , 2008, J. Cell. Autom..

[3]  G. Klir,et al.  Uncertainty-based information: Elements of generalized information theory (studies in fuzziness and soft computing). , 1998 .

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

[5]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[6]  S. Kauffman,et al.  An analysis of the class of gene regulatory functions implied by a biochemical model. , 2006, Bio Systems.

[7]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

[8]  K. Bassler,et al.  Canalization and symmetry in Boolean models for genetic regulatory networks , 2006, q-bio/0610011.

[9]  James P. Crutchfield,et al.  The Evolutionary Design of Collective Computation in Cellular Automata , 1998, adap-org/9809001.

[10]  R. Manurung,et al.  Conceptual Representations : What do they have to say about the Density Classification Task by Cellular Automata ? , 2006 .

[11]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[12]  Steve J. Heims,et al.  The Cybernetics Group , 1991 .

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

[14]  Carsten Peterson,et al.  Random Boolean network models and the yeast transcriptional network , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Luis Mateus Rocha,et al.  Material Representations: From the Genetic Code to the Evolution of Cellular Automata , 2005, Artificial Life.

[16]  Jevin D. West,et al.  Evidence for complex, collective dynamics and emergent, distributed computation in plants , 2004, Proc. Natl. Acad. Sci. USA.

[17]  Duncan J. Watts,et al.  The Structure and Dynamics of Networks: (Princeton Studies in Complexity) , 2006 .

[18]  C. Moore,et al.  Automatic filters for the detection of coherent structure in spatiotemporal systems. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Stefan Bornholdt,et al.  Boolean network models of cellular regulation: prospects and limitations , 2008, Journal of The Royal Society Interface.

[20]  Melanie Mitchell,et al.  Complex systems: Network thinking , 2006, Artif. Intell..

[21]  Edward J. McCluskey,et al.  Detection of group invariance or total symmetry of a Boolean function , 1956 .

[22]  Luis Mateus Rocha,et al.  Conceptual Structure in Cellular Automata - The Density Classification Task , 2008, ALIFE.

[23]  U. Alon.  Network motifs: theory and experimental approaches , 2007, Nature Reviews Genetics.

[24]  James Edwin Hanson,et al.  Computational Mechanics of Cellular Automata , 1993 .

[25]  Martin H. Levinson.  Linked: The New Science of Networks , 2004 .

[26]  Albert Y. Zomaya,et al.  Local information transfer as a spatiotemporal filter for complex systems. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  H. Othmer,et al.  The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster. , 2003, Journal of theoretical biology.

[28]  J. Schwartz,et al.  Theory of Self-Reproducing Automata , 1967 .

[29]  John H. Holland,et al.  Induction: Processes of Inference, Learning, and Discovery , 1987, IEEE Expert.

[30]  E. Álvarez-Buylla,et al.  Dynamics of the genetic regulatory network for Arabidopsis thaliana flower morphogenesis. , 1998, Journal of theoretical biology.

[31]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[32]  Luis Mateus Rocha,et al.  The Role of Conceptual Structure in Designing Cellular Automata to Perform Collective Computation , 2008, UC.

[33]  James P. Crutchfield,et al.  Mechanisms of Emergent Computation in Cellular Automata , 1998, PPSN.

[34]  T. Helikar,et al.  Emergent decision-making in biological signal transduction networks , 2008, Proceedings of the National Academy of Sciences.

[35]  C. Espinosa-Soto,et al.  A Gene Regulatory Network Model for Cell-Fate Determination during Arabidopsis thaliana Flower Development That Is Robust and Recovers Experimental Gene Expression Profilesw⃞ , 2004, The Plant Cell Online.

[36]  B. Derrida,et al.  Phase Transitions in Two-Dimensional Kauffman Cellular Automata , 1986 .

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

[38]  J. Crutchfield.  Is anything ever new?: considering emergence , 1999 .

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

[40]  Madalena Chaves,et al.  Robustness and fragility of Boolean models for genetic regulatory networks. , 2005, Journal of theoretical biology.

[41]  Stefan Bornholdt,et al.  Less Is More in Modeling Large Genetic Networks , 2005, Science.

[42]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[43]  George J. Klir,et al.  Uncertainty-Based Information , 1999 .

[44]  Paula Gonzaga Sá,et al.  The Gacs-Kurdyumov-Levin automaton revisited , 1992 .