- author = "W. B. Langdon",
- title = "Mapping Non-conventional Extensions of Genetic Programming",
- booktitle = "Unconventional Computing 2006",
- year = "2006",
- editor = "Cristian S. Calude and Michael J. Dinneen and Gheorghe Paun and Grzegorz Rozenberg and Susan Stepney",
- volume = "4135",
- series = "LNCS",
- pages = "166--180",
- address = "York",
- publisher_address = "Berlin Heidelberg",
- month = "4-8 " # sep,
- publisher = "Springer-Verlag",
- keywords = "genetic algorithms, genetic programming",
- ISBN = "3-540-38593-2",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_uc2002.pdf",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_uc2002.ps.gz",
-
DOI = "
10.1007/11839132_14",
- size = "15 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) and any time models (T7). We report halting probability, run time and functionality (including entropy of binary functions) of both halting and anytime programs. Turing complete program fitness landscapes, even with halt, scale poorly.",
-
notes = "http://www.cs.york.ac.uk/nature/uc06/
see also \cite{langdon:2007:NC}",
