Effectively approximating measurable sets by open sets

DOI10.1016/J.TCS.2012.01.011zbMATH Open1250.03070OpenAlexW1997006459MaRDI QIDQ418744FDOQ418744

Authors: 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

Recommendations

• Algorithmic randomness and capacity of closed sets
• On effectively closed sets of effective strong measure zero
• Computability of measurable sets via effective metrics
• Computability of measurable sets via effective topologies
• Random reals as measures of natural open sets

zbMATH Keywords

measure theoryKolmogorov complexityalgorithmic randomnesscomputability theory

Mathematics Subject Classification ID

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

Cites Work

• Algorithmic randomness and complexity.
• Computability and randomness
• Title not available (Why is that?)
• Lowness notions, measure and domination
• Title not available (Why is that?)
• Every 2-random real is Kolmogorov random
• Randomness, relativization and Turing degrees
• The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
• Calibrating Randomness
• Low for random reals and positive-measure domination
• The Kolmogorov complexity of random reals
• Limit complexities revisited
• Uniform almost everywhere domination

Cited In (6)

• Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
• Randomness notions and reverse mathematics
• Computability on measurable functions
• Coherence of reducibilities with randomness notions
• Openness of measures and closedness of their range
• 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)