- WILLEM L. FOUCHÉ, “Kolmogorov complexity and the geometry of Brownian motion”, Math. Struct. Comp. Sci., 25, № 7, 2015, 1590
- YURI I. MANIN, “Renormalisation and computation II: time cut-off and the Halting Problem”, Math. Struct. Comp. Sci., 22, № 5, 2012, 729
- Yuri I. Manin, 14, ISCS 2014: Interdisciplinary Symposium on Complex Systems, 2015, 3
- Daniel Sommerhoff, Stefan Ufer, “Acceptance criteria for validating mathematical proofs used by school students, university students, and mathematicians in the context of teaching”, ZDM Mathematics Education, 51, № 5, 2019, 717
- Cristian S. Calude, Monica Dumitrescu, “A statistical anytime algorithm for the Halting Problem”, COM, 9, № 2, 2020, 155
- Toby Cathcart Burn, Luke Ong, Steven Ramsay, Dominik Wagner, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, 1
- Xuguang Duan, Xin Wang, Peilin Zhao, Guangyao Shen, Wenwu Zhu, “DeepLogic: Joint Learning of Neural Perception and Logical Reasoning”, IEEE Trans. Pattern Anal. Mach. Intell., 2022, 1
- Holger Boche, Yannik N. Bock, Ullrich J. Monich, “On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals”, IEEE Trans. Inform. Theory, 69, № 1, 2023, 682
- Yuri I. Manin, 6158, Programs, Proofs, Processes, 2010, 307
- Favio E Miranda-Perea, Lourdes del Carmen González Huesca, P Selene Linares-Arévalo, “Interactive proof-search for equational reasoning”, Logic Journal of the IGPL, 2020, jzaa013