Skip to content
Register Sign in Wishlist

Recursion Theory, its Generalisations and Applications

$112.00 (C)

Part of London Mathematical Society Lecture Note Series

R. I. Soare, D. B. Posner, C. G. Jockusch, M. Lerman, R. Shore, D. Norman, G. E. Sacks, J. V. Tucker, C. H. Smith, D. A. Alton, R. E. Ladner.
View all contributors
  • Date Published: November 1980
  • availability: Available
  • format: Paperback
  • isbn: 9780521235433

$ 112.00 (C)
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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. The theory grew out of, and is usually still regarded, as a branch of mathematical logic. This book is a collection of advanced research/survey papers by eminent research workers in the field, based on their lectures given at the Leeds Logic Colloquium 1979. As such it provides an up-to-date view of current ideas and developments in the field of recursion theory as a whole. The individual contributions fit together naturally so as to provide an overview of all the main areas of research in the field. It will therefore be an important and invaluable source for advanced researchers and research students in mathematics and computer science (particularly in Europe, USA and USSR).

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: November 1980
    • format: Paperback
    • isbn: 9780521235433
    • length: 328 pages
    • dimensions: 228 x 152 x 23 mm
    • weight: 0.47kg
    • availability: Available
  • Table of Contents

    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.

  • Editors

    F. R. Drake

    S. S. Wainer

    Contributors

    R. I. Soare, D. B. Posner, C. G. Jockusch, M. Lerman, R. Shore, D. Norman, G. E. Sacks, J. V. Tucker, C. H. Smith, D. A. Alton, R. E. Ladner.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×