********************************************************************************************************
* *
* Classification of Elementary Cellular Automata using the Block Decomposition Method and Compression *
* *
* The Algorithmic Nature Group *
* http://algorithmicnature.org/ *
* *
********************************************************************************************************
This experiment makes a complexity classification of Elementary Cellular Automata (ECA) both with
compression and with the Block Decomposition Method.
For compression, we have used the function Compress in Mathematica 10, which is an implementation of
the deflate algorithm. BDM is also implemented in Mathematica. We provide the code and the file with
the complexity of 3x3 and 4x4 squares used in BDM (reducedD2.m).
More info:
* 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