Satisfiability and evolution

Adi Livnat; Christos Papadimitriou; Aviad Rubinstein; Gregory Valiant; Andrew Wan

doi:10.1109/FOCS.2014.62

Satisfiability and evolution

Adi Livnat, Christos Papadimitriou, Aviad Rubinstein, Gregory Valiant, Andrew Wan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Publisher	IEEE Computer Society
Pages	524-530
Number of pages	7
ISBN (Electronic)	9781479965175
DOIs	https://doi.org/10.1109/FOCS.2014.62
State	Published - 7 Dec 2014
Externally published	Yes
Event	55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 - Philadelphia, United States Duration: 18 Oct 2014 → 21 Oct 2014

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)	0272-5428

Conference

Conference	55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014
Country/Territory	United States
City	Philadelphia
Period	18/10/14 → 21/10/14

Bibliographical note

Publisher Copyright:
© 2014 IEEE.

Keywords

Boolean functions
algorithms
evolution

ASJC Scopus subject areas

General Computer Science

Access to Document

10.1109/FOCS.2014.62

Cite this

@inproceedings{9cbb77ac427c4cf3a847ff88105e13af,

title = "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.",

keywords = "Boolean functions, algorithms, evolution",

author = "Adi Livnat and Christos Papadimitriou and Aviad Rubinstein and Gregory Valiant and Andrew Wan",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 ; Conference date: 18-10-2014 Through 21-10-2014",

year = "2014",

month = dec,

day = "7",

doi = "10.1109/FOCS.2014.62",

language = "English",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "524--530",

booktitle = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

address = "United States",

}

Livnat, A, Papadimitriou, C, Rubinstein, A, Valiant, G & Wan, A 2014, Satisfiability and evolution. in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS., 6979037, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, IEEE Computer Society, pp. 524-530, 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, United States, 18/10/14. https://doi.org/10.1109/FOCS.2014.62

Satisfiability and evolution. / Livnat, Adi; Papadimitriou, Christos; Rubinstein, Aviad et al.
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, 2014. p. 524-530 6979037 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Satisfiability and evolution

AU - Livnat, Adi

AU - Papadimitriou, Christos

AU - Rubinstein, Aviad

AU - Valiant, Gregory

AU - Wan, Andrew

PY - 2014/12/7

Y1 - 2014/12/7

N2 - 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.

AB - 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.

KW - Boolean functions

KW - algorithms

KW - evolution

UR - http://www.scopus.com/inward/record.url?scp=84919999426&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2014.62

DO - 10.1109/FOCS.2014.62

M3 - Conference contribution

AN - SCOPUS:84919999426

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 524

EP - 530

BT - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

PB - IEEE Computer Society

T2 - 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014

Y2 - 18 October 2014 through 21 October 2014

ER -

Satisfiability and evolution

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this