A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties

DOI10.1016/j.tcs.2009.02.010zbMath1171.60002arXiv0711.1478WikidataQ124974439 ScholiaQ124974439MaRDI QIDQ1019738

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.1478

zbMATH Keywords

computable measures; computable metric space; Birkhoff ergodic theorem; Lipshitz observables

Mathematics Subject Classification ID

60A10: Probabilistic measure theory

60F20: Zero-one laws

Related Items

Unnamed Item, Computable Measure Theory and Algorithmic Randomness, Probability, statistics and computation in dynamical systems, From exact sciences to life phenomena: Following Schrödinger and Turing on programs, life and causality, Effective symbolic dynamics, random points, statistical behavior, complexity and entropy, Characterization of Kurtz randomness by a differentiation theorem, Computability of probability measures and Martin-Löf randomness over metric spaces, Statistical properties of dynamical systems -- Simulation and abstract computation, Rigorous computation of invariant measures and fractal dimension for maps with contracting fibers: 2D Lorenz-like maps, Computability of the Radon-Nikodym Derivative, Computing geometric Lorenz attractors with arbitrary precision, Randomness and Determination, from Physics and Computing towards Biology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamics and abstract computability: computing invariant measures
• Dynamics: a probabilistic and geometric perspective
• Effective properties of sets and functions in metric spaces with computability structure
• What are SRB measures, and which dynamical systems have them?
• Sharp polynomial estimates for the decay of correlations
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Uniform test of algorithmic randomness over a general space
• On Computable Numbers, with an Application to the Entscheidungsproblem
• An example of a computable absolutely normal number