Skip to content
Cart 
Register Sign in Wishlist
Look Inside Theories of Computability

Theories of Computability

AUD$65.95 inc GST

  • Date Published: June 2010
  • availability: Available
  • format: Paperback
  • isbn: 9780521153430

AUD$ 65.95 inc GST
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback


Looking for an inspection copy?

Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.

    • A summing up of the area by one of its leading lights (the author is the 'N. P.' for whom NP-completeness is named)
    • Broad in coverage
    • Mathematically sophisticated
    Read more

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

    Preface
    1. Finite functions and relations
    2. Finite automata and their languages
    3. Grammars and their languages
    4. Computable functions and relations
    References
    Author index
    Subject index
    Math index.

  • Author

    Nicholas Pippenger, University of British Columbia, Vancouver

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