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...
Main Authors: | Soler−Toscano, F, Zenil, H, Delahaye, J, Gauvrit, N |
---|---|
格式: | Journal article |
出版: |
Public Library of Science
2014
|
相似書籍
-
Fractal Dimension of Space−time Diagrams and the Runtime Complexity of Small Turing Machines
由: Joosten, J, et al.
出版: (2013) -
On the Kolmogorov−Chaitin Complexity for short sequences
由: Delahaye, J, et al.
出版: (2007) -
The second quantized quantum Turing machine and Kolmogorov complexity
由: Rogers, C, et al.
出版: (2008) -
Algorithmic complexity for short binary strings applied to psychology: a primer
由: Gauvrit, N, et al.
出版: (2013) -
Program−size versus Time complexity‚ Slowdown and speed−up phenomena in the micro−cosmos of small Turing machines
由: Soler−Toscano, H
出版: (2010)