Algorithmic information dynamics of cellular automata
From MaRDI portal
Publication:2086706
DOI10.1007/978-3-031-03986-7_8OpenAlexW4285114510MaRDI QIDQ2086706
Publication date: 25 October 2022
Full work available at URL: https://arxiv.org/abs/2112.13177
algorithmic complexityperturbation analysiselementary cellular automataalgorithmic information dynamicsgame of life (GoL)software space
Uses Software
Cites Work
- Life as thermodynamic evidence of algorithmic structure in natural environments
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
- ASYMPTOTIC BEHAVIOR AND RATIOS OF COMPLEXITY IN CELLULAR AUTOMATA
- Algorithmic Randomness and Complexity
- Statistical mechanics of cellular automata
- Algorithmic Information Theory
- Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World
- Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
- On the Kolmogorov-Chaitin Complexity for short sequences
- A formal theory of inductive inference. Part I
- An introduction to Kolmogorov complexity and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithmic information dynamics of cellular automata