Computability: An Introduction to Recursive Function Theory Kindle Edition

4.4 out of 5 stars 9 customer reviews
ISBN-13: 978-0521223843
ISBN-10: 0521223849
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Kindle App Ad
Digital List Price: $52.00

Deliver to your Kindle or other device

Start Date: Today
End Date:
Pay only for the time you need. Select a rental end date to see your rental price. You can also extend your rental or purchase the book at any time before your rental ends.
eTextbook features:
  • Highlight, take notes, and search in the book
  • Page numbers are just like the physical edition
Sold by: Amazon Digital Services LLC

Deliver to your Kindle or other device

Price
New from Used from
eTextbook
"Please retry"
$39.49
Hardcover
"Please retry"
$79.11

click to open popover

Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.


Editorial Reviews

Review

"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

Book Description

This introduction to recursive theory computability begins with a mathematical characterization of computable functions, develops the mathematical theory and includes a full discussion of noncomputability and undecidability. Later chapters move on to more advanced topics such as degrees of unsolvability and Gödel's Incompleteness Theorem.

Product details

  • File Size: 11436 KB
  • Print Length: 266 pages
  • Simultaneous Device Usage: Up to 4 simultaneous devices, per publisher limits
  • Publisher: Cambridge University Press (June 19, 1980)
  • Publication Date: June 19, 1980
  • Sold by: Amazon Digital Services LLC
  • Language: English
  • ASIN: B00INYG5EK
  • Text-to-Speech: Enabled
  • X-Ray:
  • Word Wise: Not Enabled
  • Lending: Not Enabled
  • Enhanced Typesetting: Enabled
  • Amazon Best Sellers Rank: #403,852 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
  • Would you like to tell us about a lower price?


Customer Reviews

Top Customer Reviews

on July 14, 2011
Format: Paperback|Verified Purchase
0Comment| 5 people found this helpful. Was this review helpful to you?YesNoReport abuse
on May 25, 2017
Format: Paperback|Verified Purchase
0Comment|Was this review helpful to you?YesNoReport abuse
on August 8, 2014
Format: Paperback|Verified Purchase
0Comment|Was this review helpful to you?YesNoReport abuse
on January 1, 2007
Format: Paperback
11 comment| 30 people found this helpful. Was this review helpful to you?YesNoReport abuse
on July 11, 2005
Format: Paperback
0Comment| 13 people found this helpful. Was this review helpful to you?YesNoReport abuse
on August 21, 2006
Format: Paperback
0Comment| 6 people found this helpful. Was this review helpful to you?YesNoReport abuse

Set up an Amazon Giveaway

Computability: An Introduction to Recursive Function Theory
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more about Amazon Giveaway
This item: Computability: An Introduction to Recursive Function Theory