Randomness and lowness notions via open covers

DOI10.1016/j.apal.2011.06.009zbMath1250.03067arXiv1303.4902MaRDI QIDQ764270

Joseph S. Miller, Laurent Bienvenu

Publication date: 13 March 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.4902

zbMATH Keywords

Kolmogorov complexity; algorithmic randomness; lowness for randomness

Mathematics Subject Classification ID

03D28: Other Turing degree structures

03D32: Algorithmic randomness and dimension

Related Items

DEEP CLASSES, Reducibilities relating to Schnorr randomness, Schnorr randomness for noncomputable measures, Unified characterizations of lowness properties via Kolmogorov complexity, Schnorr triviality and its equivalent notions, Lowness for difference tests, CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS, Defining a randomness notion via another

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability versus exact computability of martingales
• Lowness properties and randomness
• Computational randomness and lowness
• Lowness notions, measure and domination
• Lowness and nullsets
• Randomness, lowness and degrees
• MASS PROBLEMS AND HYPERARITHMETICITY
• Lowness for Kurtz randomness
• Lowness for the class of random sets
• Relativizations of randomness and genericity notions
• Low for random reals and positive-measure domination
• Schnorr randomness
• Lowness for the Class of Schnorr Random Reals