2013/12/06 by Adi Livnat, Livnat, Adi, Christos H. Papadimitriou +8 · 1 voice
Biochemistry, Genetics and Molecular Biology · Computer Science · Social Sciences · #92D15 #Computational Complexity (cs.CC) #Evolution and Genetic Dynamics #Evolutionary Game Theory and Cooperation #F.0 #FOS: Biological sciences #FOS: Computer and information sciences #Populations and Evolution (q-bio.PE) #acm:92D15 #cs.CC #msc:92D15 #q-bio.PE
paper · pdf · doi:10.48550/arxiv.1312.1983
openalex publication_date 2013/12/06 · arxiv published 2013/12/06 · arxiv created 2014/08/11 · arxiv updated 2014/08/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that, if truth assignments on n variables reproduce through recombination so that satisfaction of a particular Boolean function confers a small evolutionary advantage, then a polynomially large population over polynomially many generations (polynomial in n and the inverse of the initial satisfaction probability) will end up almost certainly consisting exclusively of satisfying truth assignments. We argue that this theorem sheds light on the problem of novelty in Evolution.