Effective symbolic dynamics, random points, statistical behavior, complexity and entropy

@article{Galatolo2010EffectiveSD,
  title={Effective symbolic dynamics, random points, statistical behavior, complexity and entropy},
  author={Stefano Galatolo and Mathieu Hoyrup and Cristobal Rojas},
  journal={Inf. Comput.},
  year={2010},
  volume={208},
  pages={23-41}
}
Dynamical systems, simulation, abstract computation
TLDR
The theoretical limits of simulation and computation of interesting quantities in dynamical systems are discussed, showing that even if they can be computed with arbitrary precision in many interesting cases, there exists some cases in which they can not.
Fiber entropy and algorithmic complexity of random orbits
We consider a finite set of transformations (T ) ∈Λ acting on a probability space (X, ), which are choosen randomly according to an ergodic stochastic process (Λ, , S). This describes a paradigmatic
Randomness on Computable Probability Spaces—A Dynamical Point of View
TLDR
It is proved that a point is Schnorr random if and only if it is typical for every mixing computable dynamics, if it follows the statistical behavior of the system.
Term Rewriting Systems as Topological Dynamical Systems
TLDR
The classic topological invariant called topological entropy turns out to be much less useful in the setting of term rewriting systems than in symbolic dynamics, and sufficient criteria is given for the induced systems to be well-defined dynamical systems.
Dynamics and abstract computability: Computing invariant measures
TLDR
This work gives general conditions under which the transfer operator is computable on a suitable set and implies the computability of many “regular enough” invariant measures and among them many physical measures.
Randomness and the Ergodic Decomposition
TLDR
This paper illustrates how the effectivity of the ergodic decomposition allows one to easily extend results from theErgodic case to the non-ergodic one (namely Poincare recurrence theorem) and shows that in some cases the er godic measures can be computed from the typical realizations of the process.
On Stability Property of Probability Laws with Respect to Small Violations of Algorithmic Randomness
TLDR
A stability property of probability laws with respect to small violations of algorithmic randomness is studied in terms of Schnorr tests of algorithmie randomness and it is shown that any universal data compression scheme is also non-stable withrespect to the class of all computable ergodic measures.
On Stability of Probability Laws with Respect to Small Violations of Algorithmic Randomness
  • V. V'yugin
  • Mathematics
    Theory of Computing Systems
  • 2015
TLDR
It is shown that a computable non-ergodic measure-preserving transformation can be constructed such that the ergodic theorem is non-stable, which means that Birkhoff’s ergodica theorem is not stable.
Computability, noncomputability, and hyperbolic systems
...
...

References

SHOWING 1-10 OF 49 REFERENCES
Algorithmic complexity of points in dynamical systems
  • H. White
  • Mathematics
    Ergodic Theory and Dynamical Systems
  • 1993
Abstract This work is based on the author's dissertation. We examine the algorithmic complexity (in the sense of Kolmogorov and Chaitin) of the orbits of points in dynamical systems. Extending a
Dynamical systems and computable information
TLDR
The method gives new indicators that measure the unpredictability of the system and allows various kind of weak chaos to be classified and it is believed that the above method is useful to classify 0-entropy time series.
An effective Borel-Cantelli Lemma. Constructing orbits with required statistical properties
TLDR
A kind of constructive Borel-Cantelli lemma is proved: given a sequence of sets A i with recursively summable measures, there are computable points which are not contained in infinitely many A i, which implies the existence of computable numbers which are normal with respect to any base.
An effective ergodic theorem and some applications
TLDR
This work proves a stronger effective ergodic theorem to include a restriction of Braverman's "graph-computable functions" and uses this to give effective er godic proofs of the effective versions of Levy-Kuzmin and Khinchin Theorems relating to continued fractions.
What is ergodic theory
Ergodic theory involves the study of transformations on measure spaces. Interchanging the words “measurable function” and “probability density function” translates many results from real analysis to
Dynamics and abstract computability: Computing invariant measures
TLDR
This work gives general conditions under which the transfer operator is computable on a suitable set and implies the computability of many “regular enough” invariant measures and among them many physical measures.
Computability and fractal dimension
TLDR
This thesis combines computability theory and various notions of fractal dimension, mainly Hausdorff dimension, and proves a general theorem on the behavior of effective dimension under r-expansive mappings, which can be seen as a generalization of Holder mappings in Cantor space.
Effective Convergence in Probability and an Ergodic Theorem forIndividual Random Sequences
TLDR
It is proved that the classical ergodic theorem is not algorithmically effective and the algorithmic approach to the substantiation of the theory of probability and information theory, based on A.N. Kolmogorov's algorithms, is correct.
...
...