A constructive version of Birkhoffʼs ergodic theorem for Martin-Löf random points-Reference-Cited by-同舟云学术

A constructive version of Birkhoffʼs ergodic theorem for Martin-Löf random points

Published:2012-01 Issue: Volume:210 Page:21-30
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Bienvenu Laurent,Day Adam R.,Hoyrup Mathieu,Mezhirov Ilya,Shen Alexander

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference14 articles.

1. Ergodic-type characterizations of algorithmic randomness;Bienvenu,2010

2. Laurent Bienvenu, Peter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen, Algorithmic tests and randomness with respect to a class of measures, in press, available at http://arxiv.org/abs/1103.1529.

3. Johanna N.Y. Franklin, Noam Greenberg, Joseph S. Miller, Keng Meng Ng, Martin-Löf random points satisfy Birkhoffʼs ergodic theorem for effectively closed sets, Proc. Amer. Math. Soc., in press.

4. Exact expressions for some randomness tests;Gács;Z. Math. Logik Grundlagen Math.,1980

5. Uniform test of algorithmic randomness over a general space;Gács;Theoret. Comput. Sci.,2005

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Typical = Random;Axioms;2023-07-27

2. Computability of convergence rates in the ergodic theorem for Martin-Löf random points;Journal of Logic and Analysis;2022-09-20

3. Ergodic Theorems and Converses for PSPACE Functions;Theory of Computing Systems;2022-08-30

4. UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS;The Bulletin of Symbolic Logic;2022-05-02

5. Randomness and uniform distribution modulo one;Information and Computation;2021-12