- author = "W. B. Langdon and R. Poli",
- title = "The Halting Probability in {von~Neumann} Architectures",
- editor = "Pierre Collet and Marco Tomassini and Marc Ebner and Steven Gustafson and Anik\'o Ek\'art",
- booktitle = "Proceedings of the 9th European Conference on Genetic Programming",
- publisher = "Springer",
- series = "Lecture Notes in Computer Science",
- volume = "3905",
- year = "2006",
- address = "Budapest, Hungary",
- month = "10 - 12 " # apr,
- organisation = "EvoNet",
- keywords = "genetic algorithms, genetic programming, Turing complete",
- ISBN = "3-540-33143-3",
- pages = "225--237",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_egp2006.pdf",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_egp2006.ps.gz",
-
DOI = "
doi:10.1007/11729976_20",
- bibsource = "DBLP, http://dblp.uni-trier.de",
- size = "13 pages",
- abstract = "Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved for an idealised machine, are tested on a small T7 computer with (finite) memory, conditional branches and jumps. Simulations confirm Turing complete fitness landscapes of this type hold at most a vanishingly small fraction of usable solutions.",
-
notes = "coupon collector problem argument could be
applied
Part of \cite{collet:2006:GP} EuroGP'2006 held in conjunction with EvoCOP2006 and EvoWorkshops2006
See also \cite{langdon:2005:CSM445}",
