Cargando…
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
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 is an alternative to the traditional lossless compre...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4014489/ https://www.ncbi.nlm.nih.gov/pubmed/24809449 http://dx.doi.org/10.1371/journal.pone.0096223 |