Statistical properties of finite sequences with high Kolmogorov complexity

1994/07/01 by Ming Li, Paul M. B. Vit�nyi · 2 citations
Computer Science · Mathematics · #Arithmetic #Benford’s Law and Fraud Detection #Binary number #Certainty #Combinatorics #Computability, Logic, AI Algorithms #Discrete mathematics #Geometry #Kolmogorov complexity #Kolmogorov structure function #Linguistics #Mathematics #Philosophy #Physics #Statistical physics #Zero (linguistics) #semigroups and automata theory

paper · doi:10.1007/bf01192146

crossref issued 1994/07/01 · crossref published 1994/07/01 · crossref published-print 1994/07/01 · openalex publication_date 1994/07/01 · crossref created 2005/02/17 · crossref deposited 2019/04/30 · crossref indexed 2023/06/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Citations

• The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
• Kolmogorov complexity arguments in combinatorics
• A Theory of Program Size Formally Identical to Information Theory
• The definition of random sequences

Cited by

• One Adaptive Trailing Head Can Outperform Many Oblivious Trailing Heads
• Incompressibility method [wikipedia]