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

Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines

 

Advanced Search
 
Opened Access Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
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: 2014
Published in: PLoS ONE, 9 (5), 1-18.
Document type: Article
Abstract: Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method i...
[See more]
Cite: Soler Toscano, F., Zenil, H., Delahaye, J. y Gauvrit, N. (2014). Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines. PLoS ONE, 9 (5), 1-18.
Size: 1.968Mb
Format: PDF

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

DOI: 10.1371/journal.pone.0096223

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)