Created by W.Langdon from gp-bibliography.bib Revision:1.8081
Our machine-language representation is generic, it contains instructions for arithmetic, register manipulation and comparison, and control flow. We also introduce an output instruction that allows variable-length sequences as result values. Importantly, this representation does not contain recursive operators; recursion, when needed, is automatically synthesised from primitive instructions.
For a fixed set of search parameters (e.g., instruction set, program size, fitness criteria), we compare the frequencies of the three directed search techniques on the four sequence problems. For this parameter set, an evolutionary-based search always out performs exhaustive hill climbing as well as undirected random search. Since only the prefix of the target sequence is variable in our experiments, we posit that this approach to sequence induction is potentially quite general.",
Genetic Programming entries for Lorenz Huelsbergen