Abstract

Various existing computer models of evolution attempt to demonstrate the efficacy of Darwinian evolution by solving simple problems. These typically use per-nucleotide (or nearest analogue) mutation rates orders of magnitude higher than biological rates. This paper compares models using typical rates for genetic algorithms with the same models using a realistic mutation rate. It finds that the models with the realistic mutation rates lose the ability to solve the simple problems. This is shown to be the result of the difficulty of evolving mutations that only provide a benefit in combination with other mutations.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.