Lowness for bounded randomness

DOI10.1016/J.TCS.2012.06.004zbMATH Open1283.68173OpenAlexW2085445328MaRDI QIDQ690469FDOQ690469

Keng Meng Ng, Rodney G. Downey

Publication date: 27 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.004

Recommendations

• Bounded randomness
• Lowness properties and randomness
• Randomness and lowness notions via open covers
• Lowness of higher randomness notions
• Relative randomness and cardinality

zbMATH Keywords

algorithmic randomness\(K\)-trivialityfinite randomnesslow for random

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Algorithmic Randomness and Complexity
• Computability and Randomness
• MASS PROBLEMS AND HYPERARITHMETICITY
• Low for random reals and positive-measure domination
• Characterizing lowness for Demuth randomness
• Title not available (Why is that?)
• Bounded Randomness
• 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

Cited In (4)

• New lower bounds for the Randić spread
• Lowness, Randomness, and Computable Analysis
• Lowness for Kurtz randomness
• Characterizing lowness for Demuth randomness

This page was built for publication: Lowness for bounded randomness

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