pith. sign in

arxiv: 1101.0833 · v2 · pith:E46HR4M4new · submitted 2011-01-04 · 🧮 math.DS · cs.CE· nlin.CD

Dynamical systems, simulation, abstract computation

classification 🧮 math.DS cs.CEnlin.CD
keywords computationcasesdynamicaldynamicsergodicinterestinginvariantsimulation
0
0 comments X
read the original abstract

We survey an area of recent development, relating dynamics to theoretical computer science. We discuss the theoretical limits of simulation and computation of interesting quantities in dynamical systems. We will focus on central objects of the theory of dynamics, as invariant measures and invariant sets, showing that even if they can be computed with arbitrary precision in many interesting cases, there exists some cases in which they can not. 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).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.