Evolving Open Complexity

author = "W. B. Langdon",

title = "Evolving Open Complexity",

journal = "SIGEVOlution newsletter of the ACM Special Interest Group on Genetic and Evolutionary Computation",

year = "2022",

volume = "15",

number = "1",

month = mar,

keywords = "genetic algorithms, genetic programming, SBSE, CS.NE, CS.AI, CS.IT/math.IT, failed disruption propagation, FDP, Data processing inequality",

ISSN = "1931-8499",

URL = "

http://arxiv.org/abs/2112.00812",

URL = "

http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/langdon_2021_sigevolution.pdf",

URL = "

https://evolution.sigevo.org/issues/HTML/sigevolution-15-1/home.html#h.dctm8h1mshda",

DOI = "

doi:10.1145/3532942.3532945",

slide_url = "

http://www.cs.ucl.ac.uk/staff/W.Langdon/ei2022/",

size = "4 pages",

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 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--100 levels of the organism's environment.",