Compression-Based Investigation of the Dynamical Properties of Cellular Automata and Other Systems

@article{Zenil2010CompressionBasedIO,
  title={Compression-Based Investigation of the Dynamical Properties of Cellular Automata and Other Systems},
  author={Hector Zenil},
  journal={Complex Syst.},
  year={2010},
  volume={19}
}
  • H. Zenil
  • Published 21 October 2009
  • Computer Science
  • Complex Syst.
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 compression based method to estimate a characteristic exponent… 

Asymptotic Behavior and ratios of Complexity in Cellular Automata

TLDR
Using two different measures, Shannon's block entropy and Kolmogorov complexity, the latter approximated by two different methods (lossless compressibility and block decomposition), the trend of larger complex behavioural fractions is arrived at.

Computational Hierarchy of Elementary Cellular Automata

TLDR
A graph is computed showing which elementary cellular automata can be emulated by which and it is shown that certain chaotic automata are the only ones that cannot emulate any automata non-trivially.

Classification of Discrete Dynamical Systems Based on Transients

TLDR
A novel classification method applicable to any class of deterministic discrete space and time dynamical systems based on classifying the asymptotic behavior of the average computation time in a given system before entering a loop is presented.

Using compression to find interesting one-dimensional cellular automata

TLDR
A new clustering algorithm has been designed and applied specifically for clustering 1D elementary cellular automata behaviour using the prediction by partial matching (PPM) compression scheme and it was discovered that the new algorithm was more effective in its ability to group interesting and unusual cellular Automata behaviours together.

Lempel-Ziv complexity analysis of one dimensional cellular automata.

TLDR
It is shown that Lempel-Ziv complexity measure can be extended, by using the normalized information distance, to study the spatiotemporal evolution of random initial configurations under cellular automata rules, and the transfer information from time consecutive configurations is studied.

A Measure for the Complexity of Elementary Cellular Automata

A new measure for the complexity of elementary cellular automata (ECAs) is presented. This measure is based on the minimization of Boolean functions with three variables that represent the elementary

On the Dynamic Qualitative Behavior of Universal Computation

  • H. Zenil
  • Computer Science
    Complex Syst.
  • 2012
TLDR
The main working hypothesis is that universality is deeply connected to the qualitative behaviour of a system, particularly to its ability to react to external stimulus–as it needs to be programmed–and to its capacity for transmitting this information.

On the Dynamic Qualitative Behaviour of Universal Computation

TLDR
The main working hypothesis is that universality is deeply connected to the qualitative behaviour of a system, particularly to its ability to react to external stimulus--as it needs to be programmed--and to its capacity for transmitting information.

Dynamics and Complexity of Computrons

TLDR
It is shown that any finite-state machine can be represented as a computron and two novel set-theoretic concepts are developed: diversity space as a metric space that captures similarity of configurations on a given graph and basin complexity as a measure of complexity of partitions of the diversity space.

Classification of Complex Systems Based on Transients

TLDR
A novel classification method applicable to any class of deterministic discrete space and time dynamical systems is presented, which distinguishes between different asymptotic behaviors of a system's average computation time before entering a loop.
...

References

SHOWING 1-10 OF 35 REFERENCES

Kolmogorov complexity and cellular automata classification

On the Classifiability of Cellular Automata

Chaotic Properties of the Elementary Cellular Automaton Rule 40 in Wolfram's Class I

  • F. Ohi
  • Computer Science
    Complex Syst.
  • 2007
TLDR
It is shown that the dynamical system defined by rule 40 is Devaney chaos on a class of configurations of some particular type and has every periodic point except prime period one, four, or six.

Time-space pattern and periodic property of elementary cellular automata — Sierpinski gasket and partially Sierpinski Gasket —

TLDR
It is logically prove that the time-space patterns of rule 180 are those cut off from theTime-space pattern of rule 90, and then prove the conjecture of Braga et al.

Pattern Growth in Elementary Cellular Automata

Complex Chaotic Behavior of a Class of Subshift Cellular Automata

TLDR
A new class of cellular auto mata is identified that is characterized by shift like dynamics (simple and complex subshift rules); these cellular automata correspond to t he asymmet ric sit uations and they are chaotic dynamical syst ems.

A new kind of science

TLDR
A New Kind of Science, written and published by Stephen Wolfram, is the outcome of the studies he conducted systematically upon cellular automata, a class of computer model which may be visualized as a set of memory locations, each containing one bit.

Cellular automata and intermediate degrees

Undecidability of CA Classification Schemes

TLDR
It is shown that it is undecidable to which class a given cellula r automaton belongs, even when choosing only between the two simp lest classes.