Autor:	Dorothea Heiss-Czedik
Rok vydání:	1998
Předmět:	symbols.namesake Formalism (philosophy of mathematics) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Theoretical computer science Turing completeness Computer science symbols Genetic programming
Zdroj:	Artificial Neural Nets and Genetic Algorithms ISBN: 9783211830871 ICANNGA
DOI:	10.1007/978-3-7091-6492-1_89
Popis:	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 λ-calculus, a Turing complete formalism with only two (very low-level) primitives.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a8e5a6099b166382a8352a1f46080e24 https://doi.org/10.1007/978-3-7091-6492-1_89 Zobrazit plný text záznamu