Sciweavers

EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
13 years 7 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 f...
William B. Langdon, Riccardo Poli
COCO
2004
Springer
106views Algorithms» more  COCO 2004»
13 years 9 months ago
Separating Complexity Classes Using Structural Properties
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
Harry Buhrman, Leen Torenvliet