Self Modifying Cartesian Genetic Programming (SMCGP)aims to be a general purpose form of developmentalgenetic programming. The evolved programs are iteratedthus allowing an infinite sequence of phenotypes(programs) to be obtained from a single evolvedgenotype. In previous work this approach has alreadyshown that it is possible to obtain mathematicallyprovable general solutions to certain problems. Weextend this class in this paper by showing how SMCGPcan be used to find algorithms that converge tomathematical constants (pi and e). Mathematical proofsare given that show that some evolved formulae convergeto pi and e in the limit as the number of iterationsincrease.
CITATION STYLE
Harding, S., Miller, J. F., & Banzhaf, W. (2010). Self modifying cartesian genetic programming (pp. 579–586). Association for Computing Machinery (ACM). https://doi.org/10.1145/1830483.1830591
Mendeley helps you to discover research relevant for your work.