Mapping non-conventional extensions of genetic programming

DOI10.1007/S11047-007-9044-XMaRDI QIDQ926513zbMATH OpenOpenAlexDBLPWikidataFDO

Authors William B. Langdon, Riccardo Poli

Publication date 20 May 2008

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-007-9044-x

zbMATH Keywords

genetic programmingprogram terminationany time computationentropy and irreversible loss of informationhalting probability genetic algorithmsMarkov analysis of program search spacesprogram convergenceTuring complete

Mathematics Subject Classification ID

Recommendations

• Mapping Non-conventional Extensions of Genetic Programming
• Slightly Beyond Turing’s Computability for Studying Genetic Programming
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
• scientific article; zbMATH DE number 1668689
• scientific article; zbMATH DE number 2040710

Cited in

(2)

• Slightly Beyond Turing’s Computability for Studying Genetic Programming
• Mapping Non-conventional Extensions of Genetic Programming

This page was built for publication: Mapping non-conventional extensions of genetic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q926513)