Skip Nav Destination
Close Modal
Update search
NARROW
Format
Date
Availability
1-2 of 2
Hector Zenil
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Proceedings Papers
. alif2016, ALIFE 2016, the Fifteenth International Conference on the Synthesis and Simulation of Living Systems200-207, (July 4–6, 2016) 10.1162/978-0-262-33936-0-ch039
Abstract
View Paper
PDF
Using algorithmic complexity theory methods, we propose a robust computational definitions for open-ended evolution (OEE) and adaptability of computable dynamical systems. With this framework, we show that decidability imposes absolute limits to the growth of complexity on computable dynamical systems up to a logarithm of a logarithmic term. Conversely, systems that exhibit open-ended evolution must be undecidable and have irreducible behaviour through the evolution of the system. Complexity is assessed in terms of three measures: sophistication, coarse sophistication and busy beaver logical depth.
Proceedings Papers
. ecal2013, ECAL 2013: The Twelfth European Conference on Artificial Life1222-1223, (September 2–6, 2013) 10.1162/978-0-262-31709-2-ch188