Algorithmic complexity of points in dynamical systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- A formal theory of inductive inference. Part I
- Algorithmic Information Theory
- Any code of which we cannot think is good
- Asymptotic optimality and asymptotic equipartiton properties of log- optimum investment
- Can an individual sequence of zeros and ones be random?
- Constructions of strictly ergodic systems
- Ergodic theory on compact spaces
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the Complexity of Finite Sequences
- On the Length of Programs for Computing Finite Binary Sequences
- Process complexity and effective random tests
- Sample converses in source coding theory
- Subsequences of normal sequences
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- THE COMPLEXITY OF THE TRAJECTORIES OF A DYNAMICAL SYSTEM
- The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
- The definition of random sequences
- Universal almost sure data compression
- Universal coding, information, prediction, and estimation
- Universal noiseless coding
- Von Mises' definition of random sequences reconsidered
Cited in
(22)- Dynamical Systems Theory and Algorithms for NP-hard Problems
- Orbit complexity and data compression
- Information and dynamical systems: A concrete measurement on sporadic dynamics
- Randomness on full shift spaces
- On the relation between entropy and the average complexity of trajectories in dynamical systems
- Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure
- Eulerian entropy and non-repetitive subword complexity
- Algorithmic Properties of Millstream Systems
- Symbolic dynamics: entropy = dimension = complexity
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Ergodic theorems and the basis of science
- scientific article; zbMATH DE number 5722780 (Why is no real title available?)
- Predictability: a way to characterize complexity
- Orbit complexity by computable structures
- Complexity for extended dynamical systems
- Asymptotic orbit complexity of infinite measure preserving transformations
- On some aspects of local thermodynamical formalism
- An algorithmic view of pseudochaos
- Fiber entropy and algorithmic complexity of random orbits
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Complexity, randomness, discretization: some remarks on a program of J. Ford
- Chaos out of order: quantum mechanics, the correspondence principle and chaos
This page was built for publication: Algorithmic complexity of points in dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290052)
