LMS: 45 Recursion Theory, Applns: Its Generalisations & Applications, Proceedings of Logic Colloquim '79, Leeds, Aug. 1979 - Brossura

Drake, F. R.

Brossura

ISBN 10: 052123543X ISBN 13: 9780521235433

Casa editrice: Cambridge University Press, 2008

Riassunto

This book is a collection of advanced research/survey papers by eminent research workers in the Recursion theory.

Su questo libro

Descrizione del libro

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.

Contenuti

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.

Dettagli dell?edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 2008
• ISBN 10: 052123543X
• ISBN 13: 9780521235433
• Rilegatura: Copertina flessibile
• Lingua: Inglese
• Numero di pagine: 328
• Contatto del produttore: non disponibile