Probing the axioms of evolutionary algorithm design: Commentary on “On the mapping of genotype to phenotype in evolutionary algorithms” by Peter A. Whigham, Grant Dick, and James Maclaurin


DOI: 10.1007/s10710-017-9290-3

Cite this article as:
Altenberg, L. Genet Program Evolvable Mach (2017). doi:10.1007/s10710-017-9290-3
Part of the following topical collections:
  1. Mapping of Genotype to Phenotype in Evolutionary Algorithms


Properties such as continuity, locality, and modularity may seem necessary when designing representations and variation operators for evolutionary algorithms, but a closer look at what happens when evolutionary algorithms perform well reveals counterexamples to such schemes. Moreover, these variational properties can themselves evolve in sufficiently complex open-ended systems. These properties of evolutionary algorithms remain very much open questions.


Fisher’s geometric model 1/5 rule Evolution of evolvability 

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Information and Computer SciencesUniversity of Hawai‘i at MānoaHonoluluUSA
  2. 2.Konrad Lorenz Institute for Evolution and Cognition ResearchKlosterneuburgAustria

Personalised recommendations