Randomness and Solovay degrees

DOI10.4115/JLA.2018.10.3MaRDI QIDQ4638260zbMATH OpenOpenAlexWikidataFDO

Authors Kenshi Miyabe, André Nies, Frank Stephan

Publication date 4 May 2018

Published in Journal of Logic and Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://logicandanalysis.org/index.php/jla/article/download/317/128

zbMATH Keywords

effective dimensionSchnorr randomnessSoloUvTay reducibility

Mathematics Subject Classification ID

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

Recommendations

• Schnorr randomness
• Schnorr randomness
• Randomness, computability, and density
• Reducibilities relating to Schnorr randomness
• scientific article; zbMATH DE number 1688364

Cites work

• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Computability and Randomness
• scientific article; zbMATH DE number 5269064 (Why is no real title available?)
• Lowness, Randomness, and Computable Analysis
• Randomness and recursive enumerability
• Randomness, computability, and density
• The complexity of stochastic sequences

Cited in

(10)

• Randomness and reducibility
• Strong Medvedev reducibilities and the KL-randomness problem
• Reducibilities relating to Schnorr randomness
• A separation of two randomness concepts
• Random models and solvable Skolem classes
• scientific article; zbMATH DE number 1984528 (Why is no real title available?)
• Solovay functions and their applications in algorithmic randomness
• Solovay reducibility and continuity
• Subclasses of the weakly random reals
• Relative randomness and cardinality

This page was built for publication: Randomness and Solovay degrees

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