Repositorio de producción científica de la Universidad de Sevilla

Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures

 

Advanced Search
 
Opened Access Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Cites

Show item statistics
Icon
Export to
Author: Soler Toscano, Fernando
Zenil, Hector
Delahaye, Jean-Paul
Gauvrit, Nicolas
Department: Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia
Date: 2013
Published in: Computability, 2 (2), 125-140.
Document type: Article
Abstract: 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), is ...
[See more]
Cite: Soler Toscano, F., Zenil, H., Delahaye, J. y Gauvrit, N. (2013). Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. Computability, 2 (2), 125-140.
Size: 672.0Kb
Format: PDF

URI: http://hdl.handle.net/11441/64143

DOI: 10.3233/COM-13019

See editor´s version

This work is under a Creative Commons License: 

This item appears in the following Collection(s)