A Speed Limit for Evolution: Postscript
In 1995 I wrote a paper: "A Speed Limit for Evolution" whose main result was that evolution must proceed rather slowly, in accordance with the earlier views and intuitions of many authors. The abstract of the paper said: "The genetic information expressed in some part of the phenotype of a species cannot increase faster than a given rate, determined by the selection pressure on that part. This rate is typically a small fraction of a bit per generation". This result was derived in the presence of sexual reproduction and other effects such as temporarily isolated sub-populations. In 1999 David Mackay published a paper which apparently contradicted this result. In the abstract, he wrote "We find striking differences between populations that have recombination and populations that do not. If variation is produced by mutation alone, then the entire population gains up to roughly 1 bit per generation. If variation is created by recombination, the population can gain of the order of sqrt(G) bits per generation." Mackay proposed that there were outstanding evolutionary benefits to sexual reproduction, and that my result was too low by a very large factor. He later repeated this result in a textbook he wrote in 2003. The purpose of this note is to show that the key assumption of Mackays model, that "fitness is a strictly additive trait" is so unrealistic as to render his results irrelevant to any actual life form. In consequence, the speed limit I derived is still valid, and has important consequences for human cognitive evolution.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A geometric speed limit for acceleration by natural selection in evolutionary processes
We derived a new speed limit in population dynamics, which is a fundamental limit on the evolutionary rate. By splitting the contributions of selection and mutation to the evolutionary rate, we obtained the new bound on …
Limits on the Evolutionary Rates of Biological Traits
This paper focuses on the maximum speed at which biological evolution can occur. I derive inequalities that limit the rate of evolutionary processes driven by natural selection, mutations, or genetic drift. These \emph{r…
There is no fast lunch: an examination of the running speed of evolutionary algorithms in several languages
It is quite usual when an evolutionary algorithm tool or library uses a language other than C, C++, Java or Matlab that a reviewer or the audience questions its usefulness based on the speed of those other languages, pur…
Evolutionary AlgorithmsBeyond Speedups: Hardware-Aware Evaluation of Evolutionary Algorithms on GPUs
Evolutionary algorithms (EAs) are increasingly executed on graphics processing units (GPUs) to exploit population-level parallelism. This shift changes the resource model under which EAs are designed and evaluated. Howev…
Guided Evolution with Binary Discriminators for ML Program Search
How to automatically design better machine learning programs is an open problem within AutoML. While evolution has been a popular tool to search for better ML programs, using learning itself to guide the search has been …
AutoMLSymbolic Regression