75 citations · 263 across the 13 of their papers we have counts for
4 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…
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…
A colouring protocol for the generalized Russian cards problem
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque +1
In the generalized Russian cards problem, Alice, Bob and Cath draw , and cards, respectively, from a deck of size . Alice and Bob must then communicate their enti…