Preview
Unable to display preview. Download preview PDF.
References
Arslanov M.M. On some generalizations of the theorem on fixed points, Izv.Vyss.Ucebn.Zaved.Matematika, 1981,no.5,9–16.
Arslanov M.M. m-reducibility and fixed points, Slognostnue Problemu Mat.Logiki,Kalinin, 1985,270–273.
Arslanov M.M. Recursively Enumerable Sets and Degrees of Unsolvability,Kazan state university,Kazan, 1986,206 p.
Soare R.I. Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Springer-Verlag, Berlin,Heidelberg,Tokyo,New York, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arslanov, M.M. (1987). The recursion theorem, approximations, and classifying index sets of recursively enumerable sets. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_9
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive