• DOI:10.3233/COM-13019
Corpus ID: 16435614

Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures

@article{SolerToscano2013CorrespondenceAI,
  title={Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures},
  author={Fernando Soler-Toscano and Hector Zenil and J. Delahaye and Nicolas Gauvrit},
  journal={ArXiv},
  year={2013},
  volume={abs/1211.4891}
}

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed