(Reprint of the 1967 edition)
Book Description
--This text refers to the
Paperback
edition.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
22 of 23 people found the following review helpful:
5.0 out of 5 stars
Good reference,
By
This review is from: Theory of Recursive Functions and Effective Computability (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.
19 of 20 people found the following review helpful:
5.0 out of 5 stars
A classic!,
By Todd Ebert (Long Beach California) - See all my reviews
This review is from: Theory of Recursive Functions and Effective Computability (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.
14 of 14 people found the following review helpful:
5.0 out of 5 stars
great book,
By A Customer
This review is from: Theory of Recursive Functions and Effective Computability (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)
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
First Sentence:
One method for characterizing a class of functions is to take, as members of the class, all functions obtainable by certain kinds of recursive definition. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
second projection theorem, hyperarithmetical sets, retraceable subset, basic tree lemma, recursive invariance, universal partial function, hyperarithmetical function, general recursive operator, general recursive functional, partial recursive operator, recursive characteristic function, wth step, recursively invariant property, hypersimple sets, univalent system, recursive permutation, single isomorphism type, recursion lemma, partial relativization, provable wffs, nonrecursive degrees, reducibility orderings, enumeration reducible, arithmetical hierarchy, full relativization Key Phrases - Capitalized Phrases (CAPs): (learn more)
Church's Thesis, Definition Let, Applying Corollary, Applying the Tarski-Kuratowski New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
One method for characterizing a class of functions is to take, as members of the class, all functions obtainable by certain kinds of recursive definition. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
second projection theorem, hyperarithmetical sets, retraceable subset, basic tree lemma, recursive invariance, universal partial function, hyperarithmetical function, general recursive operator, general recursive functional, partial recursive operator, recursive characteristic function, wth step, recursively invariant property, hypersimple sets, univalent system, recursive permutation, single isomorphism type, recursion lemma, partial relativization, provable wffs, nonrecursive degrees, reducibility orderings, enumeration reducible, arithmetical hierarchy, full relativization Key Phrases - Capitalized Phrases (CAPs): (learn more)
Church's Thesis, Definition Let, Applying Corollary, Applying the Tarski-Kuratowski New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
100
books
cite this book:
See all 100 books citing this book
- Recursive Model Theory, Volume Volume 1 (Studies in Logic and the Foundations of Mathematics) by Author Unknown on 8 pages
- Algorithmic Learning Theory: 4th International Workshop on Analogical and Inductive Inference, AII '94, 5th International Workshop on Algorithmic ... / Lecture Notes in Artificial Intelligence) by Setsuo Arikawa on 8 pages
- Algorithmic Learning Theory: 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001. Proceedings. (Lecture Notes in ... / Lecture Notes in Artificial Intelligence) by Naoki Abe on 6 pages
- An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) by Ming Li on 5 pages
- Complexity, Logic, and Recursion Theory (Lecture Notes in Pure and Applied Mathematics) by Andrea Sorbi on 4 pages
See all 100 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Listmania!
|
|
So You'd Like to...
|
|
