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

Stefano Galatolo, Mathieu Hoyrup, Crist́obal Rojas

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 [2] 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.

Original languageEnglish
Pages (from-to)7-18
Number of pages12
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume24
DOIs
Publication statusPublished - 2010

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems'. Together they form a unique fingerprint.

  • Cite this