Simon Harding
ABSTRACT
Self Modifying Cartesian Genetic Programming 2 (SMCGP2) is a general purpose, graph-based, developmental form of Cartesian Genetic Programming. Using a combination of computational functions and special functions that can modify the phenotype at runtime, it has been employed to find general solutions to a number of computational problems. Here, we apply the new SMCGP technique to find mathematical relationships between well known mathematical constants (i.e. pi, e, phi, omega etc) using a variety of functions sets. Some of formulae obtained are distinctly unusual and may be unknown in mathematics.
- S. Harding, J. F. Miller, and W. Banzhaf. Self-modifying cartesian genetic programming. In H. Lipson, editor, GECCO, pages 1021--1028. ACM, 2007. Google Scholar
Digital Library
- S. Harding, J. F. Miller, and W. Banzhaf. Self modifying cartesian genetic programming: finding algorithms that calculate pi and e to arbitrary precision. In Proceedings of the 12th annual conference on Genetic and evolutionary computation, GECCO '10, pages 579--586, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- S. Harding, J. F. Miller, and W. Banzhaf. SMCGP2: Self modifying cartesian genetic programming in two dimensions. In Accepted for publication in GECCO 2011, GECCO '11, New York, NY, USA, 2011. ACM. Google ScholarDigital Library
- SMCGP2: finding algorithms that approximate numerical constants using quaternions and complex numbers
Recommendations
SMCGP2: self modifying cartesian genetic programming in two dimensions
GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computationSelf Modifying Cartesian Genetic Programming is a general purpose, graph-based, developmental form of Cartesian Genetic Programming. Using a combination of computational functions and special functions that can modify the phenotype at runtime, it has ...
Self modifying cartesian genetic programming: finding algorithms that calculate pi and e to arbitrary precision
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computationSelf Modifying Cartesian Genetic Programming (SMCGP) aims to be a general purpose form of developmental genetic programming. The evolved programs are iterated thus allowing an infinite sequence of phenotypes (programs) to be obtained from a single ...
Evolution, development and learning using self-modifying cartesian genetic programming
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationSelf-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This paper asks: Is it possible to evolve a learning algorithm using SMCGP?
Comments