Logo image
Se connecter
Ergodic theorem and algorithmic randomness (following V. V'yugin)
Article de revue   Avec comité de lecture

Ergodic theorem and algorithmic randomness (following V. V'yugin)

Alexander Shen
Information and Computation, Vol.307
11/2025

Résumé

In this expository note we present the proof of the constructive version of Birkhoff's ergodic theorem following Vladimir V'yugin, trying to separate and state explicitly the combinatorial statement on which this proof is based. The exposition is based on his papers and explanations given during his visit to LIF (CNRS, Marseille).

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image