This experiments classifies Elementary Cellular Automata (ECA) both with lossless compression and BDM [1]. The correlation between both methods is shown.
[1] 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]
Go backYou need to be logged in to rate this experiment.
