This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. The clarity and focus of this text have established it as a classic instrument for teaching and self-study that prepares its readers for the study of advanced monographs and the current literature on recursion theory.
This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. The clarity and focus of this text have established it as a classic instrument for teaching and self-study that prepares its readers for the study of advanced monographs and the current literature on recursion theory.
Computability; Functions and Relations; The Basic Machine; Macros; Closure Properties; Definitions of Recursive Functions; Codes; Indices; Church's Thesis; Word Problems; Undecidable Theories; Relative Recursion; The Arithmetical Hierarchy; Recursively Enumerable Relations; Degrees; Evaluation of Degrees; Large RE Sets; Functions of Reals; The Analytical Hierarchy; The Projective Hierarchy
1. Computability 2. Functions and relations 3. The basic machine 4. Macros 5. Closure properties 6. Definitions of recursive functions 7. Codes 8. Indices 9. Church's thesis 10. Word problems 11. Undecidable theories 12. Relative recursion 13. The arithmetical hierarchy 14. recursively enumerable relations 15. Degrees 16. Evaluation of degrees 17. Large RE sets 18. Functions of reals 19. The analytical hierarchy 20. The projective hierarchy Suggestions for further reading Index.
Computability; Functions and Relations; The Basic Machine; Macros; Closure Properties; Definitions of Recursive Functions; Codes; Indices; Church's Thesis; Word Problems; Undecidable Theories; Relative Recursion; The Arithmetical Hierarchy; Recursively Enumerable Relations; Degrees; Evaluation of Degrees; Large RE Sets; Functions of Reals; The Analytical Hierarchy; The Projective Hierarchy
1. Computability 2. Functions and relations 3. The basic machine 4. Macros 5. Closure properties 6. Definitions of recursive functions 7. Codes 8. Indices 9. Church's thesis 10. Word problems 11. Undecidable theories 12. Relative recursion 13. The arithmetical hierarchy 14. recursively enumerable relations 15. Degrees 16. Evaluation of degrees 17. Large RE sets 18. Functions of reals 19. The analytical hierarchy 20. The projective hierarchy Suggestions for further reading Index.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826