Laurent Bienvenu, Christopher Porter, “Strong reductions in effective randomness”, Theoretical Computer Science, 459, 2012, 55
Wolfgang Merkle, Joseph Miller, André Nies, Jan Reimann, Frank Stephan, 3404, STACS 2005, 2005, 422
Jason Rute, “Computable randomness and betting for computable probability spaces”, Mathematical Logic Qtrly, 62, no. 4-5, 2016, 335
Laurent Bienvenu, Frank Stephan, Jason Teutsch, “How Powerful Are Integer-Valued Martingales?”, Theory Comput Syst, 51, no. 3, 2012, 330
Sam Buss, Mia Minnes, “Probabilistic Algorithmic Randomness”, J. symb. log., 78, no. 2, 2013, 579
Laurent Bienvenu, Wolfgang Merkle, “Constructive equivalence relations on computable probability measures”, Annals of Pure and Applied Logic, 160, no. 3, 2009, 238
Nikolay Vereshchagin, Alexander Shen, 10010, Computability and Complexity, 2017, 669
Tomislav Petrović, “A universal pair of 1/2-betting strategies”, Information and Computation, 281, 2021, 104703
Klaas Landsman, Undecidability, Uncomputability, and Unpredictability, 2021, 17
V. A. Uspensky, V. V. V’yugin, “Development of the algorithmic information theory in Russia”, J. Commun. Technol. Electron., 56, no. 6, 2011, 739