Corpus ID: 14670718

Enumerable Distributions, Randomness, Dependence

@article{Levin2012EnumerableDR,
  title={Enumerable Distributions, Randomness, Dependence},
  author={L. Levin},
  journal={ArXiv},
  year={2012},
  volume={abs/1208.2955}
}
  • L. Levin
  • Published 2012
  • Computer Science, Mathematics
  • ArXiv
  • Kolmogorov-Martin-Lof Randomness concept is extended from computable to enumerable distributions. This allows definitions of various other properties, such as mutual information in infinite sequences. Enumerable distributions (as well as distributions faced in some finite multi-party settings) are semimeasures; handling those requires some amount of care. 

    Topics from this paper.

    Forbidden information
    • L. Levin
    • Mathematics, Computer Science
    • 2013
    • 13
    • PDF
    Rarity for Semimeasures
    • 1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES
    An Introduction to Kolmogorov Complexity and Its Applications
    • 3,531
    • PDF
    A Formal Theory of Inductive Inference. Part II
    • 1,561
    • PDF
    Process Complexity and Effective Random Tests
    • 228
    • PDF
    A Theory of Program Size Formally Identical to Information Theory
    • 858
    • PDF
    The process complexity and effective random tests.
    • 113
    • PDF
    Every Sequence Is Reducible to a Random One
    • P. Gács
    • Mathematics, Computer Science
    • 1986
    • 110
    • PDF
    On the concept of a random sequence
    • 167
    A formal theory of inductive inference
    • 1,346
    Exact Expressions for Some Randomness Tests
    • P. Gács
    • Mathematics, Computer Science
    • 1980
    • 40
    • PDF