Busy beaver sets: Characterizations and applications

Daley, Robert P.

doi:10.1016/s0019-9958(82)80085-5

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where T (P ) is the halting time of the program p and BB(j), known as the busy beaver function, is the halting time of the slowest program that can be described within j bits (Daley, 1982).…”

Section: Beyond Halting States: Open-ended Evolutionmentioning

confidence: 99%

The Limits of Decidable States on Open-Ended Evolution and Emergence

Hernández-Orozco¹,

Hernández-Quiroz²,

Zenil³

2016

Proceedings of the Artificial Life Conference 2016

View full text Add to dashboard Cite

Is undecidability a requirement for open-ended evolution (OEE)? Using algorithmic complexity theory methods, we propose robust computational definitions for open-ended evolution and adaptability of computable dynamical systems. Within this framework, we show that decidability imposes absolute limits to the growth of complexity on computable dynamical systems up to a double logarithmic term. Conversely, systems that exhibit 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. We conjecture that, for similar complexity measures that assign low complexity values, decidability imposes comparable limits to the stable growth of complexity and such behaviour is necessary for non-trivial evolutionary systems. Finally, we show that undecidability of adapted states imposes novel and unpredictable behaviour on the individuals or population being modelled. Such behaviour is irreducible.

show abstract

Section: Beyond Halting States: Open-ended Evolutionmentioning

confidence: 99%