66 citations · 175 across the 15 of their papers we have counts for
4 papers · 1 filter
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…
Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness
Jean-Paul Delahaye, Hector Zenil
We describe an alternative method (to compression) that combines several theoretical and experimental results to numerically approximate the algorithmic (Kolmogorov-Chaitin) comple…
Sloane's Gap. Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS
Nicolas Gauvrit, Jean-Paul Delahaye, Hector Zenil
The Online Encyclopedia of Integer Sequences (OEIS) is made up of thousands of numerical sequences considered particularly interesting by some mathematicians. The graphic represent…