Pages that link to "Item:Q4290052"
From MaRDI portal
The following pages link to Algorithmic complexity of points in dynamical systems (Q4290052):
Displayed 13 items.
- Chaos out of order: quantum mechanics, the correspondence principle and chaos (Q639796) (← links)
- Complexity for extended dynamical systems (Q930558) (← links)
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy (Q1049402) (← links)
- Ergodic theorems and the basis of science (Q1292990) (← links)
- An algorithmic view of pseudochaos (Q1808277) (← links)
- Randomness on full shift spaces (Q1868530) (← links)
- Complexity, randomness, discretization: some remarks on a program of J. Ford (Q1963281) (← links)
- Symbolic dynamics: entropy = dimension = complexity (Q2354582) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- Fiber entropy and algorithmic complexity of random orbits (Q2676615) (← links)
- Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure (Q5705436) (← links)
- Predictability: a way to characterize complexity (Q5949629) (← links)
- Information and dynamical systems: A concrete measurement on sporadic dynamics (Q5954869) (← links)