Algorithmic complexity of points in dynamical systems

DOI10.1017/S0143385700007653zbMath0791.58064MaRDI QIDQ4290052

Homer S. White

Publication date: 14 July 1994

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

zbMATH Keywords

dynamical systemsalgorithmic complexitytopological entropyorbits of points

Mathematics Subject Classification ID

Entropy in general topology (54C70) Ergodic theory (37A99)

Related Items

Fiber entropy and algorithmic complexity of random orbits ⋮ Chaos out of order: quantum mechanics, the correspondence principle and chaos ⋮ Complexity, randomness, discretization: some remarks on a program of J. Ford ⋮ Complexity for extended dynamical systems ⋮ Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem ⋮ Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure ⋮ Predictability: a way to characterize complexity ⋮ Information and dynamical systems: A concrete measurement on sporadic dynamics ⋮ An algorithmic view of pseudochaos ⋮ Ergodic theorems and the basis of science ⋮ Effective symbolic dynamics, random points, statistical behavior, complexity and entropy ⋮ Randomness on full shift spaces ⋮ Symbolic dynamics: entropy = dimension = complexity

Cites Work

• Unnamed Item
• Subsequences of normal sequences
• Universal almost sure data compression
• Asymptotic optimality and asymptotic equipartiton properties of log- optimum investment
• Ergodic theory on compact spaces
• Process complexity and effective random tests
• Any code of which we cannot think is good
• Can an individual sequence of zeros and ones be random?
• Universal coding, information, prediction, and estimation
• Von Mises' definition of random sequences reconsidered
• The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
• Algorithmic Information Theory
• On the Complexity of Finite Sequences
• THE COMPLEXITY OF THE TRAJECTORIES OF A DYNAMICAL SYSTEM
• Universal noiseless coding
• On the Length of Programs for Computing Finite Binary Sequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The definition of random sequences
• Constructions of strictly ergodic systems
• A formal theory of inductive inference. Part I
• Sample converses in source coding theory
• On Computable Numbers, with an Application to the Entscheidungsproblem