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
- First Online:
- Cite this article as:
- Altenberg, L. Genet Program Evolvable Mach (2017). doi:10.1007/s10710-017-9290-3
- 51 Downloads
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.