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} }
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
Figures, Tables, and Topics from this paper
45 Citations
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
- Mathematics, Computer Science
- PloS one
- 2014
- 111
- PDF
Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability
- Computer Science, Mathematics
- Int. J. Parallel Emergent Distributed Syst.
- 2019
- 27
- PDF
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
- Computer Science, Mathematics
- PeerJ Comput. Sci.
- 2015
- 38
- PDF
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
- Computer Science
- ArXiv
- 2012
- 41
A Computable Measure of Algorithmic Probability by Finite Approximations
- Mathematics, Computer Science
- Complex.
- 2017
- 18
- PDF
Proceedings Machines, Computations and Universality 2013: Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small Turing Machines
- Mathematics, Computer Science
- 2013
- 1
- PDF
Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method
- Mathematics, Medicine
- Behavior research methods
- 2016
- 39
- PDF
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
- Computer Science, Mathematics
- Entropy
- 2018
- 53
- PDF
Asymptotic Behavior and ratios of Complexity in Cellular Automata
- Mathematics, Computer Science
- Int. J. Bifurc. Chaos
- 2013
- 36
- PDF
Methods of information theory and algorithmic complexity for network biology.
- Biology, Computer Science
- Seminars in cell & developmental biology
- 2016
- 52
- PDF
References
SHOWING 1-10 OF 36 REFERENCES
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
- Computer Science
- ArXiv
- 2012
- 41
The determination of the value of Rado’s noncomputable function Σ() for four-state Turing machines
- Mathematics
- 1983
- 61
- PDF
An Introduction to Kolmogorov Complexity and Its Applications
- Computer Science, Psychology
- Texts and Monographs in Computer Science
- 1993
- 3,547
- Highly Influential
- PDF
Towards a stable definition of Kolmogorov-Chaitin complexity
- Computer Science, Mathematics
- ArXiv
- 2008
- 15
- PDF
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
- Computer Science
- JACM
- 1969
- 326
- PDF