• DocumentCode
    2407447
  • Title

    Ergodic theorems for algorithmically random sequences

  • Author

    Nakamura, Masahiro

  • Author_Institution
    Dept. of Math., Osaka Univ., Japan
  • fYear
    2005
  • fDate
    29 Aug.-1 Sept. 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.
  • Keywords
    information theory; random sequences; statistical mechanics; theorem proving; Martin-Lof random sequence; Shannon-McMillan-Breiman theorem; algorithmically random sequence; ergodic theorem; recurrence time theorem; Chromium; Convergence; DC generators; Data compression; Entropy; Extraterrestrial measurements; Information theory; Mathematics; Random sequences; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2005 IEEE
  • Print_ISBN
    0-7803-9480-1
  • Type

    conf

  • DOI
    10.1109/ITW.2005.1531876
  • Filename
    1531876
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2407447