FOCS 2014
Satisfiability and Evolution
Abstract
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 the evolution of complex adaptations.
Authors
Keywords
Context
- Venue
- IEEE Symposium on Foundations of Computer Science
- Archive span
- 1975-2025
- Indexed papers
- 3809
- Paper id
- 516369937648059215