Weak randomness, genericity and Boolean decision trees

MaRDI QIDQ3567854zbMATH OpenFDO

Authors Toshio Suzuki, Masahiro Kumabe

Publication date 17 June 2010

zbMATH Keywords

genericityMartin-Löf random sequencesMartin-Löf random setsmeasurerandomnesstruth-table reductions

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Resource-bounded martingales and computable Dowd-type generic sets
• Computable Dowd-type generic oracles
• Lowness for the class of random sets
• On the interplay between effective notions of randomness and genericity
• Separations by random oracles and ``almost classes for generalized reducibilities

Cited in

(1)

• Resource-bounded martingales and computable Dowd-type generic sets

This page was built for publication: Weak randomness, genericity and Boolean decision trees

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