Research indexJournal article
Evolving open complexity
Langdon
ACM SIGEVOlution1 Apr 2022Open access
NobleIDark:/48914/w1/20260515/65F00E04DOI10.1145/3532942.3532945
Evolving open complexity
Langdon · ACM SIGEVOlution · 2022
NobleIDark:/48914/w1/20260515/65F00E04DOI10.1145/3532942.3532945
Abstract
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 lose entropy and consequently are robust and fail to propagate disruption to their outputs. This means that, while dependent upon fitness tests, many genetic changes deep within trees are silent. For evolution to proceed at a 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 that to evolve very large, very complex programs, it will be necessary to adopt an open architecture where most mutation sites are within 10--100 levels of the organism's environment.