Kolmogorov complexity and probability measures.
From MaRDI portal
Recommendations
Cites work
- A formal theory of inductive inference. Part II
- Complexity dips in random infinite binary sequences
- Complexity oscillations in infinite binary sequences
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 4020074 (Why is no real title available?)
- scientific article; zbMATH DE number 4066011 (Why is no real title available?)
- scientific article; zbMATH DE number 3433226 (Why is no real title available?)
- scientific article; zbMATH DE number 270263 (Why is no real title available?)
- scientific article; zbMATH DE number 3404221 (Why is no real title available?)
- On the Length of Programs for Computing Finite Binary Sequences
- The definition of random sequences
- Theories of computational complexity
Cited in
(8)- The Kolmogorov complexity of infinite words
- Occam bound on lowest complexity of elements
- A measure of stochastic complexity and its power in testing for randomness.
- Kolmogorov complexity, pseudorandom generators and statistical models testing.
- Kolmogorov-Complexity Based on Infinite Computations
- scientific article; zbMATH DE number 176106 (Why is no real title available?)
- Robust Measures of Information
- The Kolmogorov birthday paradox
This page was built for publication: Kolmogorov complexity and probability measures.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143836)