Chapter 1 A SURVEY OF SELF MODIFYING CARTESIAN GENETIC PROGRAMMING

Self-Modifying Cartesian Genetic Programming (SMCGP) is a gen-eral purpose, graph-based, developmental form of Cartesian Genetic Programming. In addition to the usual computational functions found in CGP, SMCGP includes functions that can modify the evolved pro-gram at run time. This means that programs can be iterated to produce an infinite sequence of phenotypes from a single evolved genotype. Here, we discuss the results of using SMCGP on a variety of different prob-lems, and see that SMCGP is able to solve tasks that require scalability and plasticity. We see how SMCGP is able to produce results that would be impossible for conventional, static Genetic Programming techniques