85 citations · 742 across the 80 of their papers we have counts for
6 papers · 1 filter
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
Hector Zenil, Santiago Hernández-Orozco, Narsis A. Kiani +2
We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic com…
Low Algorithmic Complexity Entropy-deceiving Graphs
Hector Zenil, Narsis Kiani, Jesper Tegnér
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with pro…
Formal Definitions of Unbounded Evolution and Innovation Reveal Universal Mechanisms for Open-Ended Evolution in Dynamical Systems
Alyssa M Adams, Hector Zenil, Paul CW Davies +1
Open-ended evolution (OEE) is relevant to a variety of biological, artificial and technological systems, but has been challenging to reproduce in silico. Most theoretical efforts f…
Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence
Santiago Hernández-Orozco, Francisco Hernández-Quiroz, Hector Zenil
Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended…
Asymptotic Intrinsic Universality and Reprogrammability by Behavioural Emulation
Hector Zenil, Jürgen Riedel
We advance a Bayesian concept of 'intrinsic asymptotic universality' taking to its final conclusions previous conceptual and numerical work based upon a concept of a reprogrammabil…
Interacting Behavior and Emerging Complexity
Alyssa Adams, Hector Zenil, Eduardo Hermo Reyes +1
Can we quantify the change of complexity throughout evolutionary processes? We attempt to address this question through an empirical approach. In very general terms, we simulate tw…