This is a preview of subscription content, log in via an institution to check access.
References
V. E. Kotov and V. K. Sabel'feld,Theory of Program Schemes [in Russian], Nauka, Moscow (1991).
A. J. Kfuri, A. P. Stolboushkin, and P. Uzhichin, “Some open questions in the theory of program schemes and in dynamic logics,”Usp. Mat. Nauk,44, No. 1, 35–55 (1989).
L. Blum, M. Shub, and S. Smale, “On a theory of computation and complexity over the real numbers:NP-completeness, recursive functions and universal machines,”Bull. Am. Math. Soc., New Series,21, No. 1, 1–47 (1989).
C. Michaux, Differential Fields, Machines Over the Real Numbers and Automata, Université de Mons Hainaut., Faculté de Sciences, Institut de Mathématique et d'Informatique (1992).
S. S. Goncharov and D. I. Sviridenko, “Σ-programming,”Vychisl. Sistemy,107, 3–29 (1985).
J. Barwise,Admissible Sets and Structures, Springer, Berlin (1975).
N. Cutland,Computability, an Introduction to Recursive Function Theory, Cambridge, London (1980).
Additional information
Translated fromAlgebra i Logika, Vol. 32, No. 4, pp. 349–386, July–August, 1993.
Translated by A. Morozov
Rights and permissions
About this article
Cite this article
Ashaev, I.V., Belyaev, V.Y. & Myasnikov, A.G. Toward a generalized computability theory. Algebr Logic 32, 183–205 (1993). https://doi.org/10.1007/BF02261744
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02261744