Statistical properties of finite sequences with high Kolmogorov complexity

DOI10.1007/BF01192146zbMath0830.68073MaRDI QIDQ4301638

Paul M. B. Vitányi, Ming Li

Publication date: 10 August 1994

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexityMartin Löf randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Axioms; other general questions in probability (60A05)

Related Items (3)

Quantifying local randomness in human DNA and RNA sequences using Erdös motifs ⋮ On the approximation of shortest common supersequences and longest common subsequences ⋮ On the non-randomness of maximum Lempel Ziv complexity sequences of finite size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial foundations of information theory and the calculus of probabilities
• The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
• A Theory of Program Size Formally Identical to Information Theory
• The definition of random sequences

This page was built for publication: Statistical properties of finite sequences with high Kolmogorov complexity