S. V. Kozyrev, “Transformers as a Physical Model in AI”, Lobachevskii J Math, 45:2 (2024), 710
Ali Shojaei-Fard, “Non-perturbative graph languages, halting problem and complexity”, Forum Mathematicum, 2022
Ali Shojaei-Fard, “FROM DYSON–SCHWINGER EQUATIONS TO QUANTUM ENTANGLEMENT”, J Math Sci, 266:6 (2022), 892
Cristian S. Calude, Monica Dumitrescu, “A statistical anytime algorithm for the Halting Problem”, COM, 9:2 (2020), 155
Cristian S. Calude, Monica Dumitrescu, Benedikt Löwe, “A probabilistic anytime algorithm for the halting problem”, COM, 7:2-3 (2018), 259
Ali Shojaei-Fard, “A new perspective on intermediate algorithms via the Riemann–Hilbert correspondence”, Quantum Stud.: Math. Found., 4:2 (2017), 127
Cristian S. Calude, Damien Desfontaines, “Anytime Algorithms for Non-Ending Computations”, Int. J. Found. Comput. Sci., 26:04 (2015), 465
Yuri I. Manin, Emergence, Complexity and Computation, 14, ISCS 2014: Interdisciplinary Symposium on Complex Systems, 2015, 3
Matilde Marcolli, Nicolas Tedeschi, “Entropy algebras and Birkhoff factorization”, Journal of Geometry and Physics, 97 (2015), 243
Matilde Marcolli, Lecture Notes in Computer Science, 9389, Geometric Science of Information, 2015, 271