Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Fernando Soler Toscano, Héctor Zenil, Jean-Paul Delahaye, Nicolas Gauvrit · Computability · 2013
We show that real-value approximations of Kolmogorov-Chaitin complexity K (s ) using the algorithmic coding theorem , as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), i