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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Langdon, W. B., & Poli, R. (2006). The halting probability in Von Neumann architectures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3905 LNCS, pp. 225–237). https://doi.org/10.1007/11729976_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
