Ergodic theorems for algorithmically random sequences

M. Nakamura · 2005

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.

Read the paper · More papers on PaperTik