Theory and Applications of Models of Computation

DOI10.1007/11750321MaRDI QIDQ5898928zbMATH OpenOpenAlexFDO

Authors Frank Stephan, Liang Yu

Publication date 30 April 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11750321

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Recommendations

• Lowness for Kurtz randomness
• Lowness for genericity
• Lowness and nullsets
• Lowness properties and randomness
• A Weakly 2-Random Set That Is Not Generalized Low

Cited in

(11)

• Computable analogs of cardinal characteristics: prediction and rearrangement
• Unified characterizations of lowness properties via Kolmogorov complexity
• Lowness for Demuth Randomness
• Lowness for Kurtz randomness
• Higher randomness and genericity
• WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS
• Lowness properties of reals and hyper-immunity
• A Weakly 2-Random Set That Is Not Generalized Low
• Lowness for genericity
• Lowness of higher randomness notions
• Relativized Schnorr tests with universal behavior

This page was built for publication: Theory and Applications of Models of Computation

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