Langdon, WB; Poli, R; (2008) Mapping Non-conventional Extensions of Genetic Programming. Natural Computing , 7 21 - 43. 10.1007/s11047-007-9044-x.
Full text not available from this repository.
Conventional genetic programming research excludes memory and iteration. We have begun an extensive analysis of the space through which GP or other unconventional AI approaches search and extend it to consider explicit program stop instructions (T8), including Markov analysis and any time models (T7). We report halting probability, run time and functionality (including entropy of binary functions) of both halting and anytime programs. Irreversible Turing complete program fitness landscapes, even with halt, scale poorly however loops lock-in variation allowing more interesting functions.
|Title:||Mapping Non-conventional Extensions of Genetic Programming|
|Additional information:||Invited contribution to special issue on Unconventional computing issue: 1 keywords: genetic algorithms, genetic programming notes: update of \citelangdon:2006:UC|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science > CREST|
Archive Staff Only: edit this record