Algorithmic randomness and measures of complexity
From MaRDI portal
Recommendations
Cited in
(19)- Coherence of reducibilities with randomness notions
- Randomness and initial segment complexity for measures
- Algorithmic tests and randomness with respect to a class of measures
- On elementary computability-theoretic properties of algorithmic randomness
- A measure of stochastic complexity and its power in testing for randomness.
- Relating and contrasting plain and prefix Kolmogorov complexity
- Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence
- Complexity and randomness
- Randomness – A Computational Complexity Perspective
- Ergodic-Type Characterizations of Algorithmic Randomness
- A test for randomness based on a complexity measure
- scientific article; zbMATH DE number 1531917 (Why is no real title available?)
- Strong jump-traceability
- scientific article; zbMATH DE number 4113619 (Why is no real title available?)
- Computable Measure Theory and Algorithmic Randomness
- scientific article; zbMATH DE number 969633 (Why is no real title available?)
- scientific article; zbMATH DE number 5057386 (Why is no real title available?)
- On relative randomness
- Compression of enumerations and gain
This page was built for publication: Algorithmic randomness and measures of complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870106)