We survey an area of recent development, relating dynamics to theoretical computer science. We discuss some aspects of the theoretical simulation and computation of the long term behavior of dynamical systems. We will focus on the statistical limiting behavior and invariant measures. We present a general method allowing the algorithmic approximation at any given accuracy of invariant measures. The method can be applied in many interesting cases, as we shall explain. On the other hand, we exhibit some examples where the algorithmic approximation of invariant measures is not possible. We also explain how it is possible to compute the speed of convergence of ergodic averages (when the system is known exactly) and how this entails the computation of arbitrarily good approximations of points of the space having typical statistical behaviour (a sort of constructive version of the pointwise ergodic theorem).
|Autori:||Galatolo S; Hoyrup M; Rojas C|
|Titolo:||Statistical properties of dynamical systems – Simulation and abstract computation|
|Anno del prodotto:||2012|
|Digital Object Identifier (DOI):||10.1016/j.chaos.2011.09.011|
|Appare nelle tipologie:||1.1 Articolo in rivista|