Evolutionary Automata as Foundation of Evolutionary Computation: Larry Fogel Was Right

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

@InProceedings{Eberbach:2009:cec,
  author =       "Eugene Eberbach and Mark Burgin",
  title =        "Evolutionary Automata as Foundation of Evolutionary
                 Computation: Larry Fogel Was Right",
  booktitle =    "2009 IEEE Congress on Evolutionary Computation",
  year =         "2009",
  editor =       "Andy Tyrrell",
  pages =        "2149--2156",
  address =      "Trondheim, Norway",
  month =        "18-21 " # may,
  organization = "IEEE Computational Intelligence Society",
  publisher =    "IEEE Press",
  isbn13 =       "978-1-4244-2959-2",
  file =         "P058.pdf",
  DOI =          "doi:10.1109/CEC.2009.4983207",
  abstract =     "In this paper we study expressiveness of evolutionary
                 computation. To do so we introduce evolutionary
                 automata and define their several subclasses. To our
                 surprise, we got the result that evolving finite
                 automata by finite automata leads outside its class,
                 and allows to express for example pushdown automata or
                 Turing machines. This explains partially why Larry
                 Fogel restricted representation in Evolutionary
                 Programming to finite state machines only. The power of
                 evolution is enormous indeed!",
  keywords =     "genetic algorithms, genetic programming, EP",
  notes =        "CEC 2009 - A joint meeting of the IEEE, the EPS and
                 the IET. IEEE Catalog Number: CFP09ICE-CDR",
}

Genetic Programming entries for Eugene Eberbach Mark Burgin

Citations