- author = "D. Heiss-Czedik",
- title = "Is Genetic Programming Dependent on High-level Primitives?",
- booktitle = "Artificial Neural Nets and Genetic Algorithms: Proceedings of the International Conference, ICANNGA97",
- year = "1997",
- editor = "George D. Smith and Nigel C. Steele and Rudolf F. Albrecht",
- pages = "405--408",
- address = "University of East Anglia, Norwich, UK",
- publisher = "Springer-Verlag",
- note = "published in 1998",
- keywords = "genetic algorithms, genetic programming",
- ISBN = "3-211-83087-1",
-
DOI = "
doi:10.1007/978-3-7091-6492-1_89",
-
abstract = "The aim of this paper is to refute the claim that the
success of genetic programming depends on
problem-specific high-level primitives. We therefore
apply genetic programming to the lambda-calculus, a
Turing complete formalism with only two (very
low-level) primitives.
Genetic programming is suited to find the predecessor function in the space of Lambda-definable functions without a priori knowledge. The predecessor function is historically important and documented to be a challenge and difficult to find.",
-
notes = "Dorothea Heiss, nee
Czedik-Eysenberg
http://www.sys.uea.ac.uk/Research/ResGroups/MAG/ICANNGA97/papers_frame.html",
