Irreducible complexity in a genetic algorithm
Lee Graham, Franz Oppacher, Steffen Christensen · 2007
There has been much news about the ability of evolution to evolve systems where function ceases with the removal of any of its multiple parts. In particular, a challenge has been lofted to explain how evolution can evolve such a system, given its gradualistic nature. We present an example utilizing a dynamic fitness function and parsimony pressure. Given unambiguous definitions of system, function, and part, the genetic algorithm presented here readily produces such complex systems.