Genetic Programming with Primitive Recursion

Kahrs, Stefan (2006) Genetic Programming with Primitive Recursion. In: 2006 Genetic and Evolutionary Computation Conference, 8-12 July 2006 , Seattle, Washington (USA). (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://doi.acm.org/10.1145/1143997.1144160

Abstract

When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters or certain primitive constants. This limits the expressiveness of the programs that can be evolved. It is possible to extend the expressiveness of such an approach significantly without leaving the comfort of terminating programs by including primitive recursion as a control operation.The technique used here was gene expression programming [2], a variation of grammatical evolution [8]. Grammatical evolution avoids the problem of program bloat; its separation of genotype (string of symbols) and phenotype (expression tree) permits to optimise the generated programs without interfering with the evolutionary process.

Item Type: Conference or workshop item (Poster)
Uncontrolled keywords: genetic programming primitive recursion
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:04
Last Modified: 17 Jul 2009 15:15
Resource URI: http://kar.kent.ac.uk/id/eprint/14460 (The current URI for this page, for reference purposes)
  • Depositors only (login required):