Kolmogorov-Loveland stochasticity and Kolmogorov complexity
From MaRDI portal
Publication:968271
DOI10.1007/S00224-009-9232-4zbMATH Open1204.68110OpenAlexW2043420592MaRDI QIDQ968271FDOQ968271
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
Cites Work
- Algorithmic Randomness and Complexity
- The dimensions of individual strings and sequences
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Title not available (Why is that?)
- Kolmogorov-Loveland randomness and stochasticity
- Mathematical metaphysics of randomness
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- Von Mises' definition of random sequences reconsidered
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Dimension in Complexity Classes
- Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
- Title not available (Why is that?)
- Resource-bounded balanced genericity, stochasticity and weak randomness
- Kolmogorov-Loveland stochasticity for finite strings
- New Computational Paradigms
Cited In (7)
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)
