Effectively approximating measurable sets by open sets

DOI10.1016/j.tcs.2012.01.011zbMath1250.03070OpenAlexW1997006459MaRDI QIDQ418744

Chris J. Conidis

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.011

zbMATH Keywords

Kolmogorov complexitycomputability theorymeasure theoryalgorithmic randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Theory of numerations, effectively presented structures (03D45) Other connections with logic and set theory (28E15) Algorithmic randomness and dimension (03D32)

Related Items (4)

RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ Computability on measurable functions ⋮ Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs ⋮ Coherence of reducibilities with randomness notions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
• The Kolmogorov complexity of random reals
• Limit complexities revisited
• Lowness notions, measure and domination
• Algorithmic Randomness and Complexity
• Uniform almost everywhere domination
• Calibrating Randomness
• Low for random reals and positive-measure domination
• Every 2-random real is Kolmogorov random
• Randomness, relativization and Turing degrees

This page was built for publication: Effectively approximating measurable sets by open sets