Kolmogorov-Loveland stochasticity and Kolmogorov complexity
From MaRDI portal
Publication:968271
Recommendations
Cites work
- scientific article; zbMATH DE number 3941840 (Why is no real title available?)
- scientific article; zbMATH DE number 4119313 (Why is no real title available?)
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Algorithmic randomness and complexity.
- Dimension in Complexity Classes
- Kolmogorov-Loveland randomness and stochasticity
- Kolmogorov-Loveland stochasticity for finite strings
- Mathematical metaphysics of randomness
- New Computational Paradigms
- Resource-bounded balanced genericity, stochasticity and weak randomness
- Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- The dimensions of individual strings and sequences
- Von Mises' definition of random sequences reconsidered
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(9)- Some notes on Rissanen's stochastic complexity
- Kolmogorov complexity and non-determinism
- Kolmogorov Complexity and Algorithmic Randomness
- scientific article; zbMATH DE number 5294121 (Why is no real title available?)
- Kolmogorov-Loveland stochasticity for finite strings
- Kolmogorov-Loveland randomness and stochasticity
- Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
- STACS 2005
- STACS 2005
This page was built for publication: Kolmogorov-Loveland stochasticity and Kolmogorov complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968271)