The Halting Probability in von Neumann Architectures

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

@TechReport{langdon:2006:eurogp2p,

• author = "W. B. Langdon",
• title = "The Halting Probability in {von Neumann} Architectures",
• year = "2006",
• institution = "Computer Science, University of Essex",
• number = "CSM-456",
• address = "UK",
• month = jul,
• keywords = "genetic algorithms, genetic programming",
• URL = "http://www.cs.essex.ac.uk/technical-reports/2006/csm456.pdf",
• size = "2 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 = "2 page summary of \cite{langdon:2006:eurogp}",

}

Genetic Programming entries for William B Langdon

Citations