Qty:1
  • List Price: $49.00
  • Save: $18.28 (37%)
FREE Shipping on orders over $35.
Only 7 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
FREE Shipping on orders over $35.
Used: Good | Details
Sold by RentU
Condition: Used: Good
Comment: Fast shipping from Amazon! Qualifies for Prime Shipping and FREE standard shipping for orders over $35. Overnight, 2 day and International shipping available! Excellent Customer Service.. May not include supplements such as CD, access code or DVD.
Sell yours for a Gift Card
We'll buy it for $2.00
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Theory of Recursive Functions and Effective Computability Paperback – April 22, 1987


See all 6 formats and editions Hide other formats and editions
Amazon Price New from Used from
Hardcover
"Please retry"
$22.78
Paperback
"Please retry"
$30.72
$30.72 $13.28
Unknown Binding
"Please retry"
Best%20Books%20of%202014

Frequently Bought Together

Theory of Recursive Functions and Effective Computability + Computability: An Introduction to Recursive Function Theory
Price for both: $86.05

Buy the selected items together
NO_CONTENT_IN_FEATURE

Best Books of the Year
Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Product Details

  • Paperback: 506 pages
  • Publisher: The MIT Press (April 22, 1987)
  • Language: English
  • ISBN-10: 0262680521
  • ISBN-13: 978-0262680523
  • Product Dimensions: 6 x 1 x 9 inches
  • Shipping Weight: 1.7 pounds (View shipping rates and policies)
  • Average Customer Review: 4.4 out of 5 stars  See all reviews (8 customer reviews)
  • Amazon Best Sellers Rank: #1,353,110 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

4.4 out of 5 stars
5 star
6
4 star
0
3 star
1
2 star
1
1 star
0
See all 8 customer reviews
I found it very stressful reading the book, but it was a good kind of stress.
Todd Ebert
The final part of the book covers degrees of unsolvability arithmetical hierarchy and the analytic hierarchy.
Peter Gerdes
There are lots of neat exercises- this book will keep you busy for a long time.
Jason T

Most Helpful Customer Reviews

26 of 27 people found the following review helpful By Peter Gerdes on June 5, 2000
Format: Paperback
I looked long and hard for a reference in recursion theory and this was the only one which was acceptable. Luckily it is also quite good.
Most books in the subject either introduce the material in their own non-standard notation which, while suitable for a survey course in the material is of little help when attempting to actually read papers in the field. These books are also usually very basic ignoring things like the arithmetical hierarchy. Other books in this subject seem to mostly be advanced texts and don't cover, or cover very briefly, the important theorems.
This book starts at turing machines and recursive functions. Going through the basic results like the halting problem and rapidly moving on to more advanced topics like creative sets, cylinders and hypersimple sets. Posts problem(with Friedberg's solution) and the fixed point theorem are covered as well. The final part of the book covers degrees of unsolvability arithmetical hierarchy and the analytic hierarchy.
While the book does cover recursive fucntions and turing machines I would suggest previous experience with them before reading as the coverage is brief and doesn't give the reader a feeling of how these systems work.
If you are taking a class in the subject or want to understand modern recursion theory this is a wonderful place to start.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
18 of 18 people found the following review helpful By A Customer on June 21, 2003
Format: Paperback
There are a lot of good introductory books on computation theory,
but after reading them you may be left asking "okay, what do
I read next?" Well _this_ is the book. If you're looking for something in between the undergraduate intro books and
the research-level articles then this is for you. It develops recursive function theory in a succinct, mathematically mature manner that is freed from the details of any particular formalism. You should have previous exposure to turing machines and undecidable problems, an appreciation of the defense and use of Church's thesis, and familiarity with basic mathematical logic. Just to be clear, this book is NOT:
-a computer science, programming, or algorithms book
-an introductory book
-a book about automata or weak models of computation (such as regular languages or context-free grammars)
-a complexity theory book (no time bounds or np-completeness etc)
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
21 of 22 people found the following review helpful By Todd Ebert on September 14, 2000
Format: Paperback
The definitive book on computabilty and recursive function theory. I remember reading this book in preparation for research in complexity theory. I found it very stressful reading the book, but it was a good kind of stress. The kind that forces you to think deeply about what the author is writing about. In addition to the main text, the author provides numerous thought-provoking problems whose study could make a coure unto themselves. I read this book as a 3rd-year graduate student in
math. If you are an undergraduate and are interested in computability theory, I recommend Nigel's Cutland's book on the subject.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
5 of 5 people found the following review helpful By Jason T on June 27, 2005
Format: Paperback
If there's a better book on recursive function theory, I havent seen it. It's wonderfully well-written, extremely interesting, and good both for learning and quick reference. There are lots of neat exercises- this book will keep you busy for a long time. If you are interested in recursive function theory you must have this book- I dont need to say anything else.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again