|
Abstract:
|
I start by describing and characterising the search space explored by genetic programming (GP). I show how to compute the size of the search space. Then, I introduce some work by Bill Langdon on the distribution of functionality of the programs in the search space and indicate its scientific and practical consequences. In particular, I explain why GP can work despite the immensity of the search space it explores. Then, I show recent theory on halting probability that extends these results to forms of Turing complete GP. This indicates that Turing complete GP has a hard time solving problems unless certain measures are put in place. Having characterised the search space, in the second part of the tutorial, I characterise GP as a search algorithm by using the schema theory. In the tutorial I introduce the basics of schema theory, explaining how one can derive an exact probabilistic description of GAs and GP based on schemata. I then illustrate the lessons that can be learnt from the theory and indicate some recipes to do GP well for practitioners. Despite its technical contents, an big effort has been made to limit the use of mathematical formulae and concepts to a minimum.
|
