About the work
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown 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 of CA behavior. A Gray code-based numbering scheme for initial conditions and a c
Print work information
Work information
Title Compression-based investigation of the dynamical properties of cellular automata
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown 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 of CA behavior. A Gray code-based numbering scheme for initial conditions and a c
Work type Article
Tags chaos theory, ait, compression, wolfram's 4 classes, algorithmic information theory, cellular automata classification, phase transitions, lyapunov exponent, hypersensitivity, computer science, new ideas, dynamical systems
-------------------------
Registry info in Safe Creative
Identifier 1004125973828
Entry date Apr 12, 2010, 1:00 PM UTC
License Creative Commons Attribution Non-commercial No Derivatives 3.0
-------------------------
Copyright registered declarations
Author. Holder Hector Zenil Chavez. Date Apr 12, 2010.
Information available at https://www.safecreative.org/work/1004125973828-compression-based-investigation-of-the-dynamical-properties-of-cellular-automata
/
Registration: 1004125973828
