66 citations · 175 across the 15 of their papers we have counts for
6 papers · 1 filter
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye +1
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating -dimensional…
Unpredictability and Computational Irreducibility
Herve Zwirn, Jean-Paul Delahaye
We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata an…
Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer
Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye +1
Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to…
Image Characterization and Classification by Physical Complexity
Hector Zenil, Jean-Paul Delahaye, Cedric Gaucherel
We present a method for estimating the complexity of an image based on Bennett's concept of logical depth. Bennett identified logical depth as the appropriate measure of organized…
On the Algorithmic Nature of the World
Hector Zenil, Jean-Paul Delahaye
We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin's universal distribution to identify evidence in support of or in contravent…
On the Kolmogorov-Chaitin Complexity for short sequences
Jean-Paul Delahaye, Hector Zenil
A drawback of Kolmogorov-Chaitin complexity (K) as a function from s to the shortest program producing s is its noncomputability which limits its range of applicability. Moreover,…