Process and truth-table characterisations of randomness

DOI10.1016/j.tcs.2012.05.028zbMath1247.68115OpenAlexW1993762081MaRDI QIDQ714787

Adam R. Day

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.028

zbMATH Keywords

Schnorr randomnessweak randomnesscharacterisations of computable randomnessquick process machines

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Kobayashi compressibility

Cites Work

• Strong reductions in effective randomness
• On Kurtz randomness
• Process complexity and effective random tests
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Algorithmic Randomness and Complexity
• Schnorr randomness
• On the Length of Programs for Computing Finite Binary Sequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• A unified approach to the definition of random sequences
• The definition of random sequences
• A formal theory of inductive inference. Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Process and truth-table characterisations of randomness