2011/02/13 by Mike Stimpson, Stimpson, Mike
Biochemistry, Genetics and Molecular Biology · Computer Science · #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Metaheuristic Optimization Algorithms Research #Neural and Evolutionary Computing (cs.NE) #Viral Infectious Diseases and Gene Expression in Insects #cs.NE
paper · pdf · doi:10.48550/arxiv.1102.2559
arxiv created 2011/02/13 · openalex publication_date 2011/02/13 · arxiv updated 2011/02/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Several genetic programming systems are created, each solving a different problem. In these systems, the median number of generations G needed to evolve a working program is measured. The behavior of G is observed as the difficulty of the problem is increased. In these systems, the density D of working programs in the universe of all possible programs is measured. The relationship G ~ 1/sqrt(D) is observed to approximately hold for two program-like systems. For parallel systems (systems that look like several independent programs evolving in parallel), the relationship G ~ 1/(n ln n) is observed to approximately hold. Finally, systems that are anti-parallel are considered.