Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems

Created by W.Langdon from gp-bibliography.bib Revision:1.4208

  author =       "Manuel Marques-Pita and Luis M. Rocha",
  title =        "Schema Redescription in Cellular Automata: Revisiting
                 Emergence in Complex Systems",
  booktitle =    "The 2011 IEEE Symposium on Artificial Life",
  year =         "2011",
  editor =       "Chrystopher Nehaniv and Terry Bossomaier and 
                 Hiroki Sayama",
  pages =        "233--240",
  address =      "Paris, France",
  month =        apr # " 13-15",
  organisation = "IEEE Computational Intelligence Society",
  keywords =     "genetic algorithms, genetic programming, nonlinear
                 sciences, cellular automata and lattice Gases,
                 Artificial Intelligence, Formal Languages and Automata,
                 Neural and Evolutionary Computing, Quantitative
                 Biology, Quantitative Methods",
  bibsource =    "OAI-PMH server at",
  oai =          "",
  URL =          "",
  size =         "8 pages",
  abstract =     "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 characterising the canalisation
                 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 for the density
                 classification task: the human engineered CA GKL, and
                 another obtained via genetic programming (GP). We show
                 that despite having very different collective
                 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
  notes =        "Not really on GP but does make use of GP result given
                 by \cite{andre:1996:camc}

Genetic Programming entries for Manuel Marques-Pita Luis M Rocha