Relativizations of randomness and genericity notions

DOI10.1112/BLMS/BDR007MaRDI QIDQ5199333zbMATH OpenOpenAlexFDO

Authors Johanna N. Y. Franklin, Liang Yu, Frank Stephan

Publication date 16 August 2011

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/blms/bdr007

zbMATH Keywords

2-genericitybasehighnessrelativizationSchnorr randomnessweak 1-genericity

Mathematics Subject Classification ID

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

Recommendations

• Schnorr randomness
• Schnorr randomness
• Randomness, relativization and Turing degrees
• Schnorr triviality and genericity
• L^1-computability, layerwise computability and Solovay reducibility

Cited in

(15)

• Schnorr randomness for noncomputable measures
• Highness properties close to PA completeness
• Randomness below complete theories of arithmetic
• Schnorr triviality and its equivalent notions
• Defining a randomness notion via another
• Truth-table Schnorr randomness and truth-table reducible randomness
• Randomness notions and partial relativization
• Characterizing strong randomness via Martin-Löf randomness
• Computably enumerable sets below random sets
• On the interplay between effective notions of randomness and genericity
• A computable analysis of majorizing martingales
• Randomness, relativization and Turing degrees
• Subclasses of the weakly random reals
• STRUCTURAL HIGHNESS NOTIONS
• Randomness and lowness notions via open covers

This page was built for publication: Relativizations of randomness and genericity notions

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