Bounded randomness

DOI10.1007/978-3-642-27654-5_5MaRDI QIDQ2891302zbMATH OpenOpenAlexFDO

Authors Paul Brodhead, Keng Meng Ng, Rodney G. Downey

Publication date 15 June 2012

Published in Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-27654-5_5

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Recommendations

• Lowness for bounded randomness
• Sub-computable Boundedness Randomness
• Publication:3484820
• Relative randomness for Martin-Löf random sets
• Comparing notions of randomness

Cites work

• A hierarchy of computably enumerable degrees
• Algorithmic randomness and complexity.
• Calibrating Randomness
• Computability and Randomness
• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 841084 (Why is no real title available?)
• scientific article; zbMATH DE number 5064956 (Why is no real title available?)
• On \(\Pi{}^ 0_ 1\) classes and their ranked points
• Recursive computational depth.
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Turing degrees of reals of positive effective packing dimension
• Working with strong reducibilities above totally -c.e. and array computable degrees

Cited in

(8)

• Multiple genericity: a new transfinite hierarchy of genericity notions
• Sub-computable Boundedness Randomness
• Hierarchy of Computably Enumerable Degrees II
• Sub-computable bounded pseudorandomness
• scientific article; zbMATH DE number 4156420 (Why is no real title available?)
• A hierarchy of computably enumerable degrees
• Kobayashi compressibility
• Lowness for bounded randomness

This page was built for publication: Bounded randomness

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