Self modifying cartesian genetic programming

  • Harding S
  • Miller J
  • Banzhaf W
N/ACitations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free