Evolving Open Complexity

12/01/2021
by   W. B. Langdon, et al.
0

Information theoretic analysis of large evolved programs produced by running genetic programming for up to a million generations has shown even functions as smooth and well behaved as floating point addition and multiplication loose entropy and consequently are robust and fail to propagate disruption to their outputs. This means, while dependent upon fitness tests, many genetic changes deep within trees are silent. For evolution to proceed at reasonable rate it must be possible to measure the impact of most code changes, yet in large trees most crossover sites are distant from the root node. We suggest to evolve very large very complex programs, it will be necessary to adopt an open architecture where most mutation sites are within 10 to 100 levels of the organism's environment.

READ FULL TEXT
research
04/04/2022

Failed Disruption Propagation in Integer Genetic Programming

We inject a random value into the evaluation of highly evolved deep inte...
research
02/25/2019

Faster Genetic Programming GPquick via multicore and Advanced Vector Extensions

We evolve floating point Sextic polynomial populations of genetic progra...
research
03/24/2017

Long-Term Evolution of Genetic Programming Populations

We evolve binary mux-6 trees for up to 100000 generations evolving some ...
research
11/30/2022

Genetic Programming with Local Scoring

We present new techniques for synthesizing programs through sequences of...
research
04/02/2011

Evolving a New Feature for a Working Program

A genetic programming system is created. A first fitness function f1 is ...
research
01/13/2020

Fast Generation of Big Random Binary Trees

random_tree() is a linear time and space C++ implementation able to crea...
research
02/13/2011

Toward Measuring the Scaling of Genetic Programming

Several genetic programming systems are created, each solving a differen...

Please sign up or login with your details

Forgot password? Click here to reset