Dynamics and abstract computability: computing invariant measures

DOI10.3934/DCDS.2011.29.193MaRDI QIDQ628764zbMATH OpenOpenAlexFDO

Authors Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas

Publication date 7 March 2011

Published in Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

computable metric spacealgorithmic theorycomputable dynamical systemcomputable invariant measure

Mathematics Subject Classification ID

Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Applications of computability and recursion theory (03D80)

Abstract: We consider the question of computing invariant measures from an abstract point of view. We work in a general framework (computable metric spaces, computable measures and functions) where this problem can be posed precisely. We consider invariant measures as fixed points of the transfer operator and give general conditions under which the transfer operator is (sufficiently) computable. In this case, a general result ensures the computability of isolated fixed points and hence invariant measures (in given classes of "regular" measures). This implies the computability of many SRB measures. On the other hand, not all computable dynamical systems have a computable invariant measure. We exhibit two interesting examples of computable dynamics, one having an SRB measure which is not computable and another having no computable invariant measure at all, showing some subtlety in this kind of problems.

Recommendations

• On the Computation of Invariant Measures in Random Dynamical Systems
• Publication:3198534
• On a construction of invariant measures of dynamical systems
• Computability and dynamical systems
• Invariant measures and their computation.
• Invariant measures for Cantor dynamical systems
• Computability in Symbolic Dynamics
• New Computational Paradigms
• Computability in planar dynamical systems
• Computing invariant measures for expanding circle maps

Cited in

(22)

• Tight space-noise tradeoffs in computing the ergodic measure
• On the computability of rotation sets and their entropies
• Computability of Subsets of Metric Spaces
• Arithmetical hierarchy of the Besicovitch-stability of noisy tilings
• Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
• Computability at zero temperature
• Computability of topological entropy: from general systems to transformations on Cantor sets and the interval
• Statistical properties of dynamical systems -- Simulation and abstract computation
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
• Computational intractability of attractors in the real quadratic family
• Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable
• On the topological aspects of the theory of represented spaces
• Robust non-computability of dynamical systems and computability of robust dynamical systems
• Probability, statistics and computation in dynamical systems
• Computable Geometric Complex Analysis and Complex Dynamics
• Realizing semicomputable simplices by computable dynamical systems
• Computability of Brolin-Lyubich measure
• Computability of topological pressure on compact shift spaces beyond finite type*
• Non computable Mandelbrot-like sets for a one-parameter complex family
• Computable Measure Theory and Algorithmic Randomness
• Effective Riemann mappings of multiply connected domains and Riemann surfaces

This page was built for publication: Dynamics and abstract computability: computing invariant measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628764)