Evolutionary Turing machines: The quest for busy beavers

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

  author =       "Penousal Machado and Francisco B. Pereira and 
                 Jorge Tavares and Ernesto Costa and Amilcar Cardoso",
  title =        "Evolutionary {Turing} machines: The quest for busy
  booktitle =    "Recent Developments in Biologically Inspired
  publisher =    "Idea Group Publishing",
  year =         "2004",
  editor =       "Leandro N. {de Castro} and Fernando J. {Von Zuben}",
  chapter =      "2",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "1-59140-312-X",
  URL =          "http://www.cisuc.uc.pt/acg/dlfile.php?fn=792_pub_Beaver-chapter-2004.pdf",
  abstract =     "In this chapter we study the feasibility of using
                 Turing Machines as a model for the evolution of
                 computer programs. To assess this idea we select, as
                 test problem, the Busy Beaver - a well-known
                 theoretical problem of undisputed interest and
                 difficulty proposed by Tibor Rado in 1962. We focus our
                 research on representational issues and on the
                 development of specific genetic operators, proposing
                 alternative ways of encoding and manipulating Turing
                 Machines. The results attained on a comprehensive set
                 of experiments show that the proposed techniques bring
                 significant performance improvements. Moreover, the use
                 of a graph based crossover operator, in conjunction
                 with new representation techniques, allowed us to
                 establish new best candidates for the 6, 7, and 8
                 states instances of the 4 tuple Busy Beaver problem.",
  notes =        "http://www.idea-group.com/books/details.asp?id=4376",

Genetic Programming entries for Penousal Machado Francisco Jose Baptista Pereira Jorge Tavares Ernesto Costa Amilcar Cardoso