66 citations · 175 across the 15 of their papers we have counts for
4 papers · 1 filter
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1
We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministi…
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approxima…
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…
Towards a stable definition of Kolmogorov-Chaitin complexity
Jean-Paul Delahaye, Hector Zenil
Although information content is invariant up to an additive constant, the range of possible additive constants applicable to programming languages is so large that in practice it p…