Work information
Compression-based investigation of cellular automata, Phase Transition and a Conjecture
In a recent paper, forthcoming in the journal of Complex Systems vol. 19, I present a method for studying the qualitative behavior of cellular automata and other abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm. I show that the compression-based approach classifies cellular automata (CA) into clusters according to their heuristic behavior, with these clusters showing a correspondence with Wolfram's main classes
