A computable analysis of majorizing martingales

DOI10.1112/BLMS.12458MaRDI QIDQ5006388zbMATH OpenOpenAlexFDO

Authors 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 randomness and dimension (03D32) Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Effective martingales with restricted wagers
• Highness properties close to PA completeness
• Automata, Languages and Programming

Cites work

• \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
• Algorithmic randomness and complexity.
• Computability and randomness
• Cone avoidance and randomness preservation
• Deep _1⁰ classes
• scientific article; zbMATH DE number 3570458 (Why is no real title available?)
• Lowness properties and randomness
• Propagation of partial randomness
• Randomness and lowness notions via open covers
• Reducibilities relating to Schnorr randomness
• Relativizations of randomness and genericity notions
• Subsystems of second order arithmetic
• The importance of \(\Pi^0_1\) classes in effective randomness
• Using random sets as oracles

Cited in

(2)

• Upper bound on some hightness notions
• Dimensionality and randomness

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

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