Self-modifying cartesian genetic programming

9 years 5 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is sufficient to make such a system evolvable. Consequently researchers have been investigating forms of computational development that may allow more evolvable systems. The approaches taken have largely used re-writing, multi- cellularity, or genetic regulation. In many cases it has been difficult to produce general purpose computation from such systems. In this paper we introduce computational development using a form of Cartesian Genetic Programming that includes self-modification operations. One advantage of this approach is that ab initio the system can be used to solve computational problems. We present results on a number of problems and demonstrate the characteristics and advantages that self-modification brings. Categories and Subject Descriptors I.2 [Artificial Intelligence]: [Miscellaneous] General T...
Simon Harding, Julian Francis Miller, Wolfgang Ban
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Authors Simon Harding, Julian Francis Miller, Wolfgang Banzhaf
Comments (0)