Algorithms, games, and evolution.

Proc Natl Acad Sci U S A

Computer Science Division, University of California, Berkeley, CA, 94720.

Published: July 2014

Even the most seasoned students of evolution, starting with Darwin himself, have occasionally expressed amazement that the mechanism of natural selection has produced the whole of Life as we see it around us. There is a computational way to articulate the same amazement: "What algorithm could possibly achieve all this in a mere three and a half billion years?" In this paper we propose an answer: We demonstrate that in the regime of weak selection, the standard equations of population genetics describing natural selection in the presence of sex become identical to those of a repeated game between genes played according to multiplicative weight updates (MWUA), an algorithm known in computer science to be surprisingly powerful and versatile. MWUA maximizes a tradeoff between cumulative performance and entropy, which suggests a new view on the maintenance of diversity in evolution.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4115542PMC
http://dx.doi.org/10.1073/pnas.1406556111DOI Listing

Publication Analysis

Top Keywords

natural selection
8
algorithms games
4
games evolution
4
evolution seasoned
4
seasoned students
4
students evolution
4
evolution starting
4
starting darwin
4
darwin occasionally
4
occasionally expressed
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!