Skip to content

 

Esamples are currently unavailable. We are working to correct the issues as quickly as possible. Thank you for your patience. 

Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist
Computability

Computability
An Introduction to Recursive Function Theory

$59.00

  • Date Published: June 1980
  • availability: Available
  • format: Paperback
  • isbn: 9780521294652

$59.00
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Request examination copy

Instructors may request a copy of this title for examination

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.

    Reviews & endorsements

    "Dr. Cutland has produced here an excellent and much needed textbook which will undoubtedly help to establish recursion theory as a more widely taught branch of mainstream mathematics." Mathematics & Physics

    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: June 1980
    • format: Paperback
    • isbn: 9780521294652
    • length: 264 pages
    • dimensions: 229 x 152 x 15 mm
    • weight: 0.39kg
    • availability: Available
  • Table of Contents

    Preface
    Prologue, prerequisites and notation
    1. Computable functions
    2. Generating computable functions
    3. Other approaches to computability: Church’s thesis
    4. Numbering computable functions
    5. Universal programs
    6. Decidability, undecidability and partical decidability
    7. Recursive and recursively enumerable sets
    8. Arithmetic and Gödel’s incompleteness theorem
    9. Reducibility and degrees
    10. Effective operations on partial functions
    11. The second recursion theorem
    12. Complexity of computation
    13. Further study.

  • Author

    Nigel Cutland

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

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 ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

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.
×