Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures

  title={Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures},
  author={Fernando Soler-Toscano and Hector Zenil and J. Delahaye and Nicolas Gauvrit},
  • Fernando Soler-Toscano, Hector Zenil, +1 author Nicolas Gauvrit
  • Published 2013
  • Mathematics, Computer Science
  • ArXiv
  • 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 deterministic Turing machines with up to 5 states (and 2 symbols), is in agreement with the number of instructions used by the Turing machines producing s, which is consistent with strict integer-value program-size complexity. Nevertheless, K_m proves to be a finer-grained measure and a potential alternative approach to lossless… CONTINUE READING
    45 Citations
    A Computable Measure of Algorithmic Probability by Finite Approximations
    • 18
    • PDF
    Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method
    • 39
    • PDF
    Asymptotic Behavior and ratios of Complexity in Cellular Automata
    • 36
    • PDF
    Methods of information theory and algorithmic complexity for network biology.
    • 52
    • PDF


    On the Kolmogorov-Chaitin Complexity for short sequences
    • 34
    • PDF
    From Philosophy to Program Size
    • 15
    • PDF
    The determination of the value of Rado’s noncomputable function Σ() for four-state Turing machines
    • 61
    • PDF
    The Universal Turing Machine: A Half-Century Survey
    • 521
    An Introduction to Kolmogorov Complexity and Its Applications
    • Ming Li, P. Vitányi
    • Computer Science, Psychology
    • Texts and Monographs in Computer Science
    • 1993
    • 3,547
    • Highly Influential
    • PDF
    Most Programs Stop Quickly or Never Halt
    • 69
    • PDF
    Towards a stable definition of Kolmogorov-Chaitin complexity
    • 15
    • PDF
    Clustering by compression
    • 770
    • PDF
    On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
    • 326
    • PDF