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

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

2010-06-02

arxiv.org/abs/1006.0392v1

EPTCS 24, 2010, pp. 7-18

Computer Science

Numerical Analysis

Scientific paper

10.4204/EPTCS.24.6

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.

Affiliated with

Also associated with

No associations

Rating

Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512889