Satisfiability and Evolution
Computational Complexity
2014-08-13 v3 Populations and Evolution
Abstract
We show that, if truth assignments on 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 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.
Cite
@article{arxiv.1312.1983,
title = {Satisfiability and Evolution},
author = {Adi Livnat and Christos Papadimitriou and Aviad Rubinstein and Gregory Valiant and Andrew Wan},
journal= {arXiv preprint arXiv:1312.1983},
year = {2014}
}