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

Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility

 

Advanced Search
 
Opened Access Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
Cites

Show item statistics
Icon
Export to
Author: Zenil, Hector
Soler Toscano, Fernando
Delahaye, Jean-Paul
Gauvrit, Nicolas
Department: Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia
Date: 2015
Published in: PeerJ Computer Sciense, 1:e23, 1-31.
Document type: Article
Abstract: We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional deterministic Turing machine. The ...
[See more]
Cite: Zenil, H., Soler Toscano, F., Delahaye, J. y Gauvrit, N. (2015). Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility. PeerJ Computer Sciense, 1:e23, 1-31.
Size: 2.919Mb
Format: PDF

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

DOI: 10.7717/peerj-cs.23

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)