Effectively approximating measurable sets by open sets
From MaRDI portal
(Redirected from Publication:418744)
Recommendations
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Algorithmic randomness and complexity.
- Calibrating Randomness
- Computability and randomness
- Every 2-random real is Kolmogorov random
- Limit complexities revisited
- Low for random reals and positive-measure domination
- Lowness notions, measure and domination
- Randomness, relativization and Turing degrees
- The Kolmogorov complexity of random reals
- The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
- Uniform almost everywhere domination
Cited in
(6)- Computability on measurable functions
- Randomness notions and reverse mathematics
- Coherence of reducibilities with randomness notions
- Openness of measures and closedness of their range
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
- Openess of convex measurable correspondences
This page was built for publication: Effectively approximating measurable sets by open sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418744)