The strength of the Besicovitch-Davies theorem

DOI10.1007/978-3-642-13962-8_26MaRDI QIDQ3576210zbMATH OpenOpenAlexFDO

Authors Bjørn Kjos-Hanssen, Jan Reimann

Publication date 29 July 2010

Published in Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13962-8_26

zbMATH Keywords

algorithmic randomnesscomputability theorygeometric measure theory

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Length, area, volume, other geometric measure theory (28A75) Hausdorff and packing measures (28A78) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Muchnik degrees and cardinal characteristics
• Mass problems and almost everywhere domination
• Mass Problems and Randomness
• Hausdorff-dimension and weak truth-table reducibility
• Effective aspects of Hausdorff and Fourier dimension

Cited in

(4)

• Strong Bertini Theorems
• Irrationality exponent, Hausdorff dimension and effectivization
• The strength of the \(\Delta\)-system lemma
• Muchnik degrees and cardinal characteristics

This page was built for publication: The strength of the Besicovitch-Davies theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576210)