Abstract
Self-modifying Cartesian genetic programming (SMCGP) is a general purpose, graph-based, form of genetic programming founded on Cartesian genetic programming. In addition to the usual computational functions, it includes functions that can modify the program encoded in the genotype. SMCGP has high scalability in that evolved programs encoded in the genotype can be iterated to produce an infinite sequence of programs (phenotypes). It also allows programs to acquire more inputs and produce more outputs during iterations. Another attractive feature of SMCGP is that it facilitates the evolution of provably general solutions to various computational problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banzhaf, W., Miller, J.F.: The Challenge of Complexity, chap. 11, pp. 243–260. Kluwer Academic (2004)
Harding, S., Miller, J.F., Banzhaf, W.: Self-modifying Cartesian Genetic Programming. In: Proc. Genetic and Evolutionary Computation Conference, pp. 1021–1028 (2007)
Harding, S., Miller, J.F., Banzhaf, W.: Development and Learning Using Self-modifying Cartesian Genetic Programming. In: Proc. Genetic and Evolutionary Computation Conference, pp. 699–706. ACM Press (2009)
Harding, S., Miller, J.F., Banzhaf, W.: Self-modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing. In: Proc. European Conference on Genetic Programming, LNCS, vol. 5481, pp. 133–144 (2009)
Harding, S., Miller, J.F., Banzhaf, W.: Self-modifying Cartesian Genetic Programming: Parity. In: Proc. IEEE Congress on Evolutionary Computation, pp. 285–292 (2009)
Harding, S., Miller, J.F., Banzhaf, W.: Developments in Cartesian Genetic Programming: Self-modifying CGP. Genetic Programming and Evolvable Machines 11, 397–439 (2010)
Harding, S., Miller, J.F., Banzhaf, W.: Self-modifying Cartesian Genetic Programming: Finding algorithms that calculate pi and e to arbitrary precision. In: Proc. Genetic and Evolutionary Computation Conference, pp. 579–586. ACM (2010)
Harding, S., Miller, J.F., Banzhaf, W.: SMCGP2: Finding Algorithms That Approximate Numerical Constants Using Quaternions and Complex Numbers. In: Proc. Genetic and Evolutionary Computation Conference Companion, pp. 197–198. ACM (2011)
Harding, S., Miller, J.F., Banzhaf, W.: SMCGP2: Self-modifying Cartesian Genetic Programming in Two Dimensions. In: Proc. Genetic and Evolutionary Computation Conference, pp. 1491–1498. ACM (2011)
Huelsbergen, L.: Finding General Solutions to the Parity Problem by Evolving Machine-Language Representations. In: J.R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D.B. Fogel, M.H. Garzon, D.E. Goldberg, H. Iba, R. Riolo (eds.) Proc. Conference on Genetic Programming, pp. 158–166. Morgan Kaufmann (1998)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press (1992)
Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press (1994)
Langdon, W.B.: Scaling of program fitness spaces. Evolutionary Computation 7(4), 399–428 (1999)
Poli, R., Langdon, W.B.: Foundations of Genetic Programming. Springer (2002)
Poli, R., Page, J.: Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes. Genetic Programming and Evolvable Machines 1(1–2), 37–56 (2000)
Schmidt, M., Lipson, H.: Distilling free-form natural laws from experimental data. Science 324, 81–85 (2009)
Schmidt, M., Lipson, H.: Solving iterated functions using genetic programming. In: Proc. Conference Companion on Genetic and Evolutionary Computation, pp. 2149–2154. ACM (2009)
Spector, L., Clark, D.M., Lindsay, I., Barr, B., Klein, J.: Genetic programming for finite algebras. In: Proc. Genetic and Evolutionary Computation Conference, pp. 1291–1298. ACM (2008)
Spector, L., Robinson, A.: Genetic programming and autoconstructive evolution with the Push programming language. Genetic Programming and Evolvable Machines 3, 7–40 (2002)
Streeter, M., Becker, L.A.: Automated Discovery of Numerical Approximation Formulae via Genetic Programming. Genetic Programming and Evolvable Machines 4, 255–286 (2003)
Walker, J.A., Miller, J.F.: Investigating the Performance of Module Acquisition in Cartesian Genetic Programming. In: Proc. Genetic and Evolutionary Computation Conference, pp. 1649–1656. ACM (2005)
Walker, J.A., Miller, J.F.: Automatic Acquisition, Evolution and Re-use of Modules in Cartesian Genetic Programming. IEEE Transactions on Evolutionary Computation 12, 397–417 (2008)
Wong, L.M.: Evolving Recursive Programs by Using Adaptive Grammar Based Genetic Programming. Genetic Programming and Evolvable Machines 6, 421–455 (2005)
Wong, M.L., Leung, K.S.: Evolving Recursive Functions for the Even-Parity Problem Using Genetic Programming. In: P.J. Angeline, K.E. Kinnear, Jr. (eds.) Advances in Genetic Programming 2, chap. 11, pp. 221–240. MIT Press (1996)
Yu, T.: Hierachical Processing for Evolving Recursive and Modular Programs Using Higher Order Functions and Lambda Abstractions. Genetic Programming and Evolvable Machines 2, 345–380 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Harding, S.L., Miller, J.F., Banzhaf, W. (2011). Self-Modifying Cartesian Genetic Programming. In: Miller, J. (eds) Cartesian Genetic Programming. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17310-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-17310-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17309-7
Online ISBN: 978-3-642-17310-3
eBook Packages: Computer ScienceComputer Science (R0)