Skip to content
naulon
Not checkedNot checked for notices yet.

Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems

Stefano Galatolo, Mathieu Hoyrup, Cristóbal Rojas

Electronic Proceedings in Theoretical Computer Science · 2010

doi:10.4204/eptcs.24.6 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior as a typical point of the system. It was proved in [Avigad et al. 2010, Local stability of ergodic averages] that in a system whose dynamics is computable the ergodic averages of computable observables converge effectively. We give an alternative, simpler proof of this result. This implies that if also the invariant measure is computable then the pseudorandom points are a set which is dense (hence nonempty) on the support of the invariant measure.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.