N. N. Nepeivoda, “Semantics of algorithmic languages”, J Math Sci, 25, № 6, 1984, 1558
Wilfried Sieg, John Byrnes, 6, Gödel ’96, 1996, 98
Ksenia Tatarchenko, Anya Yermakova, Liesbeth De Mol, “Russian Logics and the Culture of Impossible: Part II—Reinterpreting Algorithmic Rationality”, IEEE Annals Hist. Comput., 43, № 4, 2021, 57
128, Computability, Complexity, Logic, 1989, 528
35, Theories of Computational Complexity, 1988, 453
A. N. Kolmogorov, V. A. Uspenskii, “Algorithms and Randomness”, Theory Probab. Appl., 32, № 3, 1988, 389
YURI R BOGLAEV, “ENTROPY OF ALGORITHMS AND POTENTIAL PARALLELISM”, Parallel Algorithms and Applications, 3, № 1-2, 1994, 109
Johan Georg Granström, Treatise on Intuitionistic Type Theory, 2011, 77
Robin K. Hill, “What an Algorithm Is”, Philos. Technol., 29, № 1, 2016, 35
Vladimir A. Uspensky, “Kolmogorov and mathematical logic”, J. symb. log., 57, № 2, 1992, 385