Recursion Theory, its Generalisations and Applications
Cambridge University Press (Verlag)
9780521235433 (ISBN)
1. Fundamental methods for connecting recursively enumerable degrees R. I. Soare; 2. A Survey of Non-RE Degrees ≤ 0' D. B. Posner; 3. Degrees of Generic Sets C. G. Jockusch; 4. The Degrees of Unsolvability: Some recent results M. Lerman; 5. Some Constructions in ά-Recursion theory R. Shore; 6. The Recursion theory of the continuous functionals D. Norman; 7. Three aspects of recursive enumerability in higher types G. E. Sacks; 8. Computing in Algebraic Systems J. V. Tucker; 9. Applications of Classical Recursion theory to computer science C. H. Smith; 10. 'Natural' programming languages and complexity measures for subrecursive programming languages: An Abstract Approach D. A. Alton; 11. Complexity Theory with Emphasis on the complexity of logical theories R. E. Ladner.
| Erscheint lt. Verlag | 13.11.1980 |
|---|---|
| Reihe/Serie | London Mathematical Society Lecture Note Series |
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 152 x 228 mm |
| Gewicht | 470 g |
| Themenwelt | Mathematik / Informatik ► Mathematik |
| ISBN-13 | 9780521235433 / 9780521235433 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich