Bounded randomness

DOI10.1007/978-3-642-27654-5_5zbMATH Open1353.03045OpenAlexW2913438647MaRDI QIDQ2891302FDOQ2891302

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

Recommendations

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

Mathematics Subject Classification ID

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

Cites Work

• Algorithmic randomness and complexity.
• Computability and Randomness
• Title not available (Why is that?)
• Calibrating Randomness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Turing degrees of reals of positive effective packing dimension
• Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Recursive computational depth.
• A hierarchy of computably enumerable degrees
• On \(\Pi{}^ 0_ 1\) classes and their ranked points

Cited In (8)

• Lowness for bounded randomness
• Sub-computable bounded pseudorandomness
• A hierarchy of computably enumerable degrees
• Sub-computable Boundedness Randomness
• Title not available (Why is that?)
• Multiple genericity: a new transfinite hierarchy of genericity notions
• Hierarchy of Computably Enumerable Degrees II
• Kobayashi compressibility

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)