About the work
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
Print work information
Work information
Title 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
Work type Article
Tags general
-------------------------
Registry info in Safe Creative
Identifier 1008227106115
Entry date Aug 22, 2010, 3:00 AM UTC
License Creative Commons Attribution Non-commercial No Derivatives 3.0
-------------------------
Copyright registered declarations
Author. Holder Hector Zenil Chavez. Date Aug 22, 2010.
Information available at https://www.safecreative.org/work/1008227106115-compression-based-investigation-of-cellular-automata-phase-transition-and-a-conjecture
/
Registration: 1008227106115
