Coherence of reducibilities with randomness notions
From MaRDI portal
Publication:1787952
Recommendations
Cites work
- Algorithmic randomness and complexity.
- Algorithmic randomness and measures of complexity
- Computability and randomness
- Effectively approximating measurable sets by open sets
- Every 2-random real is Kolmogorov random
- Kolmogorov complexity and solovay functions
- Limit complexities revisited
- On Kurtz randomness
- On initial segment complexity and degrees of randomness
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
- Randomness, relativization and Turing degrees
- Reconciling Data Compression and Kolmogorov Complexity
- Reducibilities relating to Schnorr randomness
- Schnorr randomness
- Schnorr trivial sets and truth-table reducibility
- Schnorr triviality and genericity
- Schnorr triviality and its equivalent notions
- Solovay functions and their applications in algorithmic randomness
- The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
- Von Mises' definition of random sequences reconsidered
Cited in
(6)
This page was built for publication: Coherence of reducibilities with randomness notions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787952)