Recursion Theory, Its Generalisations and Applications

Klappentext This book is a collection of advanced research/survey papers by eminent research workers in the Recursion theory. Zusammenfassung Recursion theory – now a well-established branch of pure mathematics, having grown rapidly over the last 35 years – deals with the general (abstract) theory of those operations which we conceive as being `computable' by idealized machines. Inhaltsverzeichnis 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.

Product details

• Authors: F. R. Drake, F. R. Wainer Drake, F.r. Wainer Drake
• Assisted by: F. R. Drake (Editor), N. J. Hitchin (Editor), S. S. Wainer (Editor)
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Paperback / Softback
• Released: 13.11.1980
• EAN: 9780521235433
• ISBN: 978-0-521-23543-3
• No. of pages: 328
• Series: Cambridge Studies in the Histo
• Subject: Natural sciences, medicine, IT, technology > Mathematics > General, dictionaries