A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
A simple genetic algorithm for reducible complexity
Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07
Challenges are often lofted to explain how gradualistic evolution can evolve systems where function ceases with the removal of any of their multiple parts. We present a genetic algorithm (GA) example using a dynamic fitness function. Given clear definitions of relevant terms, the GA produces such complex systems.doi:10.1145/1276958.1277243 dblp:conf/gecco/GrahamCO07 fatcat:ejpnyeylkne2fgifgvznvcir2a