Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic) [Hardcover]

R. I. Soare (Author)

Book Description

Publication Date: March 2004 | ISBN-10: 0387152997 | ISBN-13: 978-0387152998

The first part consists of an introduction to the theory of computation and recursive function theory, including definitions of computable functions, Turing machines, partial recursive functions, recursively enumerable sets, the Kleene recursion theorem etc. The second part is a comprehensive study of recursively enumerable sets and their degrees.

Product Details

• Hardcover: 437 pages
• Publisher: Springer (March 2004)
• Language: English
• ISBN-10: 0387152997
• ISBN-13: 978-0387152998
• Product Dimensions: 9.6 x 6.6 x 1.1 inches
• Shipping Weight: 1.6 pounds
• Average Customer Review: 4.0 out of 5 stars  See all reviews (3 customer reviews)
• Amazon Best Sellers Rank: #2,099,368 in Books (See Top 100 in Books)

More About the Author

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

Customer Reviews

Most Helpful Customer Reviews

7 of 8 people found the following review helpful:

3.0 out of 5 stars Standard graduate introduction, July 11, 2005

By 

Nathan Oakes (Ashland, Oregon) - See all my reviews

This review is from: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic) (Hardcover)

This text was specifically written to replace Rogers as the standard graduate introduction. As you will see if you ask around, it wasn't completely successful. That is because, while Rogers is creaking with age, it is interesting. This book is not. It is a detailed and orderly presentation of what the author thinks is important, but that does not include any context, motivation, relations to other math, or applications. It is painfully dull. (There is a 2e in the works, but the excerpts I saw were about the same.) Also, it starts very fast and will be confusing if you haven't already done a book like Cutland. I think the problem is that he has been a master of the subject for so long that he can't put himself in the mind of someone coming to the material for the first time.

10 of 14 people found the following review helpful:

5.0 out of 5 stars Excellent Presentation of Recursive Enumerablility, February 3, 1999

By A Customer

This review is from: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic) (Hardcover)

The type face selection is excellent. The material is consistently developed throughout. The reader walks away from the first three chapters with a wealth of clear understanding of the sophisticated topics covered. The remaining chapters delve into current research up to the date of publication. Highly recommended for those interested in recursion theory.

2 of 4 people found the following review helpful:

4.0 out of 5 stars good book, November 13, 2003

By 

"ihaveanideal" (NZ) - See all my reviews

This review is from: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic) (Hardcover)

It is a standard text book for the students and researchers in recursion theory. You can read it without any recursion background. Once you have read the last page, you can claim you are a recursion theoriest.

But the style of the book has a little out of date. The author are rewriting it.

For those who want to know more about recursion theory, I recommand Rogers' book (but it is an older than Soare's).