This paper presents building block functions, i.e., functions in which explicit schemas of high fitness are defined (BB functions, for short) which are useful in investigating the character of Genetic Programming (GP) search. One conjecture we believe to be answerable through experimentation with these functions is whether GP power that, when primary partial solutions are discovered, their numbers increase and GP crossover is able to combine them into increasingly larger sub-solutions and eventually find the solution? The functions should also provide insight into more detailed aspects of the roles of GP crossover and GP genotype growth.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by Santa Fe Institute in its series Working Papers with number
94-04-020.