- Tomasz Steifer, 12813, Connecting with Computability, 2021, 424
- Christopher P. Porter, “Continuous randomness via transformations of 2-random sequences”, Information and Computation, 292, 2023, 105028
- Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen, 7318, How the World Computes, 2012, 395
- Rod Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan A. Terwijn, “Calibrating Randomness”, Bull. symb. log., 12, no. 3, 2006, 411
- Laurent Bienvenu, “Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity”, Theory Comput Syst, 46, no. 3, 2010, 598
- Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen, “How much randomness is needed for statistics?”, Annals of Pure and Applied Logic, 165, no. 9, 2014, 1470
- Laurent Bienvenu, Frank Stephan, Jason Teutsch, 6158, Programs, Proofs, Processes, 2010, 59
- Hayato Takahashi, “Algorithmic randomness and monotone complexity on product space”, Information and Computation, 209, no. 2, 2011, 183
- Сергей Иванович Адян, Sergei Ivanovich Adian, Алексей Львович Семeнов, Aleksei L'vovich Semenov, Владимир Андреевич Успенский, Vladimir Andreevich Uspenskii, “Андрей Альбертович Мучник (некролог)”, УМН, 62, no. 4, 2007, 140
- Nikolay Vereshchagin, Alexander Shen, Measures of Complexity, 2015, 235