Lowness for Demuth Randomness

DOI10.1007/978-3-642-03073-4_17MaRDI QIDQ3576048zbMATH OpenOpenAlexFDO

Authors Keng Meng Ng, Rodney G. Downey

Publication date 28 July 2010

Published in Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03073-4_17

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Cites work

• Beyond strong jump traceability
• Computational randomness and lowness
• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 5354044 (Why is no real title available?)
• scientific article; zbMATH DE number 4053595 (Why is no real title available?)
• scientific article; zbMATH DE number 1048044 (Why is no real title available?)
• scientific article; zbMATH DE number 2063218 (Why is no real title available?)
• Lowness for Kurtz randomness
• Lowness for the Class of Schnorr Random Reals
• Lowness properties and approximations of the jump
• Lowness properties and randomness
• Lowness properties of reals and hyper-immunity
• On strongly jump traceable reals
• Randomness and Computability: Open Questions
• Reals which compute little
• Schnorr trivial sets and truth-table reducibility
• Splitting into degrees with low computational strength
• Strong jump-traceability. I: The computably enumerable case
• Strong jump-traceability. II: K-triviality
• The importance of \(\Pi^0_1\) classes in effective randomness
• Theory and Applications of Models of Computation
• Using random sets as oracles
• 𝐾-trivial degrees and the jump-traceability hierarchy

Cited in

(4)

• Characterizing lowness for Demuth randomness
• Lowness for Kurtz randomness
• Computably enumerable sets below random sets
• On the interplay between effective notions of randomness and genericity

This page was built for publication: Lowness for Demuth Randomness

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