Mapping non-conventional extensions of genetic programming

Authors:
W. B. Langdon
Affiliations:
Department of Computer Science, University of Essex, UK
Venue:
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Year:
2006

Citing 5
Cited 1

An algebraic equation for the halting probability

A half-century survey on The Universal Turing Machine
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Foundations of genetic programming

Foundations of genetic programming
A Mathematical Theory of Communication

A Mathematical Theory of Communication
The halting probability in von neumann architectures

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming

Scaling of program functionality

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

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) and any time models (T7). We report halting probability, run time and functionality (including entropy of binary functions) of both halting and anytime programs. Turing complete program fitness landscapes, even with halt, scale poorly.