- Bruno Bauwens, Ilya Blinnikov, 12159, Computer Science – Theory and Applications, 2020, 130
- Adam Case, Christopher P. Porter, “The Intersection of Algorithmically Random Closed Sets and Effective Dimension”, ACM Trans. Comput. Logic, 23, № 4, 2022, 1
- Xiang Huang, Jack H. Lutz, Andrei N. Migunov, 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2019, 615
- Gordon Belot, “That Does Not Compute: David Lewis on Credence and Chance”, Philos. sci., 90, № 5, 2023, 1130
- Tom F. Sterkenburg, “Putnam’s Diagonal Argument and the Impossibility of a Universal Learning Machine”, Erkenn, 84, № 3, 2019, 633
- George Barmpalias, Lu Liu, “Aspects of Muchnik's Paradox in Restricted Betting”, SSRN Journal, 2022
- George Barmpalias, Alexander Shen, “The Kučera–Gács theorem revisited by Levin”, Theoretical Computer Science, 947, 2023, 113693
- Geerten Rijsdijk, Giovanni Sileno, 1398, Artificial Intelligence and Machine Learning, 2021, 106
- Andrei Romashchenko, Alexander Shen, Marius Zimand, “27 Open Problems in Kolmogorov Complexity”, SIGACT News, 52, № 4, 2021, 31
- Ruslan Ishkuvatov, Daniil Musatov, Alexander Shen, “Approximating Kolmogorov complexity”, COM, 12, № 3, 2023, 283