Identifying randomness given by high descriptive complexity

DOI10.1007/BF00998683zbMath0805.68065OpenAlexW2165105466MaRDI QIDQ1325197

Willem L. Fouché

Publication date: 26 January 1995

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00998683

zbMATH Keywords

random seriesKolmogorov-Chaitin complexityrandom combinatorial configurations

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of probability theory (60A99) Applications of computability and recursion theory (03D80)

Related Items

Characterising the Martin-Löf random sequences using computably enumerable sets of measure one ⋮ Kolmogorov complexity and symmetric relational structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Process complexity and effective random tests
• Von Mises' definition of random sequences reconsidered
• The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
• Algorithmic Information Theory
• Probabilities over rich languages, testing and randomness
• On the Length of Programs for Computing Finite Binary Sequences
• The definition of random sequences