Relativizations of randomness and genericity notions
From MaRDI portal
Publication:5199333
DOI10.1112/blms/bdr007zbMath1226.03051OpenAlexW2166579265MaRDI QIDQ5199333
Liang Yu, Johanna N. Y. Franklin, 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
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items
Defining a randomness notion via another, Characterizing strong randomness via Martin-Löf randomness, STRUCTURAL HIGHNESS NOTIONS, Computably enumerable sets below random sets, Truth-table Schnorr randomness and truth-table reducible randomness, Highness properties close to PA completeness, Randomness and lowness notions via open covers, A computable analysis of majorizing martingales, Randomness below complete theories of arithmetic, Schnorr triviality and its equivalent notions