• DocumentCode
    180819
  • Title

    Satisfiability and Evolution

  • Author

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

  • fYear
    2014
  • fDate
    18-21 Oct. 2014
  • Firstpage
    524
  • Lastpage
    530
  • 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; computability; Boolean function; satisfiability; truth assignments; Boolean functions; Couplings; Educational institutions; Genetics; Sociology; Standards; Statistics; Boolean functions; algorithms; evolution;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on
  • Conference_Location
    Philadelphia, PA
  • ISSN
    0272-5428
  • Type

    conf

  • DOI
    10.1109/FOCS.2014.62
  • Filename
    6979037