Natural complexity, computational complexity and depth
From MaRDI portal
Publication:5264347
DOI10.1063/1.3634009zbMath1317.70016arXiv1111.2845WikidataQ51605804 ScholiaQ51605804MaRDI QIDQ5264347
Publication date: 27 July 2015
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.2845
70K55: Transition to stochasticity (chaotic behavior) for nonlinear problems in mechanics
Cites Work
- Unnamed Item
- Unnamed Item
- Toward a quantitative theory of self-generated complexity
- The computational complexity of pattern formation
- The computational complexity of the Lorentz lattice gas
- Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness
- What is complexity?
- Sampling chaotic trajectories quickly in parallel
- Universal computation and physical dynamics
- The parallel complexity of growth models
- The computational complexity of generating random fractals
- Existence of a phase-transition in a one-dimensional Ising ferromagnet
- Predictability, Complexity, and Learning
- Excess entropy in natural language: Present state and perspectives
- Effective Complexity and Its Relation to Logical Depth
- Complexity through nonextensivity