The recursion theorem, approximations, and classifying index sets of recursively enumerable sets
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)
KeywordsComputer System Natural Number Equivalence Relation Mathematical Logic Problem Complexity
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Arslanov M.M. On some generalizations of the theorem on fixed points, Izv.Vyss.Ucebn.Zaved.Matematika, 1981,no.5,9–16.Google Scholar
- 2.Arslanov M.M. m-reducibility and fixed points, Slognostnue Problemu Mat.Logiki,Kalinin, 1985,270–273.Google Scholar
- 3.Arslanov M.M. Recursively Enumerable Sets and Degrees of Unsolvability,Kazan state university,Kazan, 1986,206 p.Google Scholar
- 4.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.Google Scholar
© Springer-Verlag Berlin Heidelberg 1987