Experiments

The Block Decomposition Method on the Binary Walk dataset Fernando Soler-Toscano 1311 2014/11/17 2014/11/17

We apply the Block Decomposition Method to the Binary Walk data. The Block Decomposition Method is that presented in [2] but working over the one-dimensional data in [1]. See the results folder to get the complexity distribution of the used binary strings.

References:

[1] Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye and Nicolas Gauvrit, “Calculating
Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines”,
PLoS ONE 9(5): e96223. doi:10.1371/journal.pone.0096223

[2] Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye and Nicolas Gauvrit, “Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility”. [arXiv:1212.6745]

http://arxiv.org/abs/1212.6745

Go back

You need to be logged in to rate this experiment.