Graph explorer

Satisfiability and Evolution

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.

8 nodes7 linksoverview previewSatisfiability and Evolution
8 nodes7 links
Satisfiability and Evolution8 visible / 8 total nodes / 17 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalAuthorshipWSatisfiability and Evolutionpreprint / 2014AAdi LivnatResearcherAChristos PapadimitriouResearcherAAviad RubinsteinResearcherAGregory ValiantResearcherTPopulations and Evolution1941 worksTComputational Complexity1354 worksAAndrew WanResearcher
PaperSignal 107 links

Satisfiability and Evolution

preprint / 2014

Open