Quarterly (winter, spring, summer, fall)
128 pp. per issue
7 x 10, illustrated
ISSN
1064-5462
E-ISSN
1530-9185
2014 Impact factor:
1.39

Artificial Life

Winter 2018, Vol. 24, No. 1, Pages 56-70
(doi: 10.1162/ARTL_a_00254)
© 2018 Massachusetts Institute of Technology
Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence
Article PDF (174.03 KB)
Abstract

Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended evolution and the adaptability of computable dynamical systems. Within this framework, we show that decidability imposes absolute limits on the stable growth of complexity in computable dynamical systems. Conversely, systems that exhibit (strong) open-ended evolution must be undecidable, establishing undecidability as a requirement for such systems. Complexity is assessed in terms of three measures: sophistication, coarse sophistication, and busy beaver logical depth. These three complexity measures assign low complexity values to random (incompressible) objects. As time grows, the stated complexity measures allow for the existence of complex states during the evolution of a computable dynamical system. We show, however, that finding these states involves undecidable computations. We conjecture that for similar complexity measures that assign low complexity values, decidability imposes comparable limits on the stable growth of complexity, and that such behavior is necessary for nontrivial evolutionary systems. We show that the undecidability of adapted states imposes novel and unpredictable behavior on the individuals or populations being modeled. Such behavior is irreducible. Finally, we offer an example of a system, first proposed by Chaitin, that exhibits strong OEE.