Dissipative Arithmetic

title = "Dissipative Arithmetic",

journal = "Complex Systems",

year = "2022",

volume = "31",

number = "3",

pages = "287--309",

keywords = "genetic algorithms, genetic programming, Information loss, Irreversible computing, Entropy, Evolvability, Arithmetic, Software mutational robustness, Optimal test oracle placement, Evolution of complexity, Data dependent computational irreducibility, Effective computational equivalence, Experimental mathematics, Algorithmic information dynamics, rounding error",

ISSN = "0891-2513",

URL = "

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

DOI = "

doi:10.25088/ComplexSystems.31.3.287",

size = "23 pages",

abstract = "Large arithmetic expressions are dissipative, they lose information, and are robust to perturbations. Lack of conservation gives resilience to fluctuations. The limited precision of floating point and the mixture of linear and nonlinear operations makes such functions anti-fragile and gives a largely stable locally flat plateau rich fitness landscape. This slows long term evolution of complex programs suggesting a need for depth aware crossover and mutation operators in tree-based genetic programming. It also suggests that deeply nested computer program source code is error tolerant because disruptions tend to fail to propagate and therefore the optimal placement of test oracles is as close to software defects as practical.",