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.
|Title of host publication||Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS|
|Publisher||IEEE Computer Society|
|Number of pages||7|
|State||Published - 7 Dec 2014|
|Event||55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 - Philadelphia, United States|
Duration: 18 Oct 2014 → 21 Oct 2014
|Name||Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS|
|Conference||55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014|
|Period||18/10/14 → 21/10/14|
Bibliographical notePublisher Copyright:
© 2014 IEEE.
- Boolean functions
ASJC Scopus subject areas
- Computer Science (all)