A computable analysis of majorizing martingales

DOI10.1112/blms.12458OpenAlexW3123356305MaRDI QIDQ5006388

Lu Liu

Publication date: 13 August 2021

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

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducibilities relating to Schnorr randomness
• Propagation of partial randomness
• Randomness and lowness notions via open covers
• Cone avoidance and randomness preservation
• Lowness properties and randomness
• RT₂² does not imply WKL₀
• Kolmogorov complexity and the Recursion Theorem
• Algorithmic Randomness and Complexity
• The importance of Π₁⁰ classes in effective randomness
• Relativizations of randomness and genericity notions
• Using random sets as oracles
• DEEP CLASSES

This page was built for publication: A computable analysis of majorizing martingales