Back to Search
Start Over
Ergodic theorems for algorithmically random sequences
- Source :
- ITW
- Publication Year :
- 2005
- Publisher :
- IEEE, 2005.
-
Abstract
- We extend the recurrence time theorem, which is originally derived by Wyner and Ziv, to individual Martin-Lof random sequences. We also present a simple, alternative proof of the algorithmic Shannon-McMillan-Breiman theorem that was first proved by V'yugin.
- Subjects :
- Discrete mathematics
Statistics::Applications
Proofs of Fermat's little theorem
Continuous mapping theorem
Wiener–Khinchin theorem
Combinatorics
Mathematics::Logic
Compactness theorem
Danskin's theorem
Brouwer fixed-point theorem
Slutsky's theorem
Algorithmically random sequence
Computer Science::Information Theory
Mathematics
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- IEEE Information Theory Workshop, 2005.
- Accession number :
- edsair.doi...........df7666c0dfc0b4c43b2f9c3e49f4f3aa
- Full Text :
- https://doi.org/10.1109/itw.2005.1531876