Created by W.Langdon from gp-bibliography.bib Revision:1.7428
The representations typically used in GP are not capable of expressing recursion, however a few researchers have introduced recursion into the representation. These representations are then capable of expressing the primitive recursive functions (PRFs) which are a subclass of the partial recursive function (which correspond to the computable functions). We prove that given two representations which express the PRFs, the complexity of a function with respect to either of these representations is invariant within an additive constant. This is in the same vein as the proof of the invariants of Kolmogorov complexity \cite{ming93introduction} and the proof in \cite{woodward:Modularity}. We comment on the important of the class of PRFs for learning.",
Genetic Programming entries for John R Woodward