Disentangling complexity from randomness and chaos
From MaRDI portal
Publication:405986
DOI10.3390/e14020177zbMath1371.68128OpenAlexW2129287212MaRDI QIDQ405986
Publication date: 8 September 2014
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e14020177
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Cellular automata (computational aspects) (68Q80) Foundations of equilibrium statistical mechanics (82B03) Measures of information, entropy (94A17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- What is a complex system?
- Two-dimensional cellular automata
- Are deterministic descriptions and indeterministic descriptions observationally equivalent?
- Random sequence generation by cellular automata
- What is complexity?
- The calculi of emergence: Computation, dynamics and induction
- Non-triviality of a discrete Bak--Sneppen evolution model
- Statistical complexity and disequilibrium
- Measures of statistical complexity: why?
- Information Theory and Statistical Mechanics
- Boltzmann's Dilemma: An Introduction to Statistical Mechanics via the Kac Ring
- What Are the New Implications of Chaos for Unpredictability?
- Statistical mechanics of cellular automata
- COMPLEXITY AS A SYSTEM PROPERTY†
- Twenty Problems in the Theory of Cellular Automata
- A NONLINEAR DYNAMICS PERSPECTIVE OF WOLFRAM'S NEW KIND OF SCIENCE PART I: THRESHOLD OF COMPLEXITY
- An Introduction to Chaos in Nonequilibrium Statistical Mechanics
- On the Length of Programs for Computing Finite Binary Sequences
- Three approaches to the quantitative definition of information*
- On the Length of Programs for Computing Finite Binary Sequences
- A formal theory of inductive inference. Part I
- On Computable Numbers, with an Application to the Entscheidungsproblem
