ASYMPTOTIC BEHAVIOR AND RATIOS OF COMPLEXITY IN CELLULAR AUTOMATA

DOI10.1142/S0218127413501599zbMath1277.37026arXiv1304.2816MaRDI QIDQ2866061

Hector Zenil, Elena Villarreal-Zapata

Publication date: 13 December 2013

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.2816

zbMATH Keywords

cellular automataShannon entropyKolmogorov-Chaitin complexitylossless compressibilityWolfram classification

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Topological entropy (37B40)

Related Items (8)

Stability of cellular automata trajectories revisited: branching walks and Lyapunov profiles ⋮ An information-based classification of elementary cellular automata ⋮ Rule Primality, Minimal Generating Sets, Turing-Universality and Causal Decomposition in Elementary Cellular Automata ⋮ Progress, gaps and obstacles in the classification of cellular automata ⋮ Classifying 1D elementary cellular automata with the 0-1 test for chaos ⋮ Characterization of complex image spatial structures based on symmetrical Weibull distribution model for texture pattern classification ⋮ Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks ⋮ Algorithmic information dynamics of cellular automata

Cites Work

• A Mathematical Theory of Communication
• Two-dimensional cellular automata
• Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
• Twenty Problems in the Theory of Cellular Automata
• A unified approach to the definition of random sequences
• The definition of random sequences

This page was built for publication: ASYMPTOTIC BEHAVIOR AND RATIOS OF COMPLEXITY IN CELLULAR AUTOMATA