Ergodic theorems for individual random sequences
type: Item
instance of: scholarly article
title: Ergodic theorems for individual random sequences
zbMATH Open document ID: 0915.68092
DOI: 10.1016/S0304-3975(98)00072-3
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 1238746
zbMATH Keywords: individual random sequence
zbMATH Keywords: Birkhoff's ergodic theorem
zbMATH Keywords: Shannon-McMillan-Breiman theorem
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: algorithmic information theory
author: Vladimir V. V'yugin
MaRDI profile type: Publication
cites work: Q5515914
cites work: Q5573965
cites work: Q3314114
cites work: Exact Expressions for Some Randomness Tests
cites work: Q3214803
cites work: Logical basis for information theory and probability theory
cites work: Combinatorial foundations of information theory and the calculus of probabilities
cites work: Algorithms and Randomness
cites work: Subadditive mean ergodic theorems
cites work: Q4070738
cites work: Q4023358
cites work: The definition of random sequences
cites work: The Shannon-McMillan-Breiman theorem for a class of amenable groups
cites work: Q5573961
cites work: Process complexity and effective random tests
cites work: Q3321154
cites work: Can an individual sequence of zeros and ones be random?
cites work: The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
cites work: Q4272798
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
description: scientific article; zbMATH DE number 1238746