Sciweavers

EUROGP
2006
Springer

The Halting Probability in Von Neumann Architectures

13 years 6 months ago
The Halting Probability in Von Neumann Architectures
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.
William B. Langdon, Riccardo Poli
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where EUROGP
Authors William B. Langdon, Riccardo Poli
Comments (0)