Mapping Non-conventional Extensions of Genetic Programming

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

  author =       "William B. Langdon and Riccardo Poli",
  title =        "Mapping Non-conventional Extensions of Genetic
  journal =      "Natural Computing",
  year =         "2008",
  pages =        "21--43",
  volume =       "7",
  issue =        "1",
  month =        mar,
  note =         "Invited contribution to special issue on
                 Unconventional computing",
  keywords =     "genetic algorithms, genetic programming, entropy,
                 information theory",
  URL =          "",
  DOI =          "doi:10.1007/s11047-007-9044-x",
  size =         "23 pages",
  abstract =     "Conventional genetic programming research excludes
                 memory and iteration. We have begun an extensive
                 analysis of the space through which GP or other
                 unconventional AI approaches search and extend it to
                 consider explicit program stop instructions (T8),
                 including Markov analysis and any time models (T7). We
                 report halting probability, run time and functionality
                 (including entropy of binary functions) of both halting
                 and anytime programs. Irreversible Turing complete
                 program fitness landscapes, even with halt, scale
                 poorly however loops lock-in variation allowing more
                 interesting functions.",
  notes =        "Halting problem solved. Update of
                 \cite{langdon:2006:UC} Cited by

Genetic Programming entries for William B Langdon Riccardo Poli