Kolmogorov-Loveland stochasticity and Kolmogorov complexity

DOI10.1007/s00224-009-9232-4zbMath1204.68110OpenAlexW2043420592MaRDI QIDQ968271

Laurent Bienvenu

Publication date: 5 May 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9232-4

zbMATH Keywords

Kolmogorov complexityeffective Hausdorff dimensionKolmogorov-Loveland stochasticity

Mathematics Subject Classification ID

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

Related Items (1)

How much randomness is needed for statistics?

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematical metaphysics of randomness
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• The dimensions of individual strings and sequences
• Kolmogorov-Loveland stochasticity for finite strings
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Kolmogorov-Loveland randomness and stochasticity
• Algorithmic Randomness and Complexity
• Von Mises' definition of random sequences reconsidered
• Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
• Dimension in Complexity Classes
• Resource-bounded balanced genericity, stochasticity and weak randomness
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• New Computational Paradigms

This page was built for publication: Kolmogorov-Loveland stochasticity and Kolmogorov complexity