|
Title: Theory of Recursive Functions and Effective Computability
Purchase
Item
Manufacturer: The MIT Press
List Price: $45.00
Our Price: $15.00
|
|
| Customer Reviews: |
| Theory of Recursive Functions and Effective Computability by The MIT Press All time clasic |
| Very difficult to read...very difficult exercises...and some have been proved wrong over the years...But, although its difficult i think is the best introduction to the subject for the time being... |
| Theory of Recursive Functions and Effective Computability by The MIT Press Old but still the most popular |
After four decades, this is still the most popular graduate text on recursion theory. I think the success is due to its stock of valuable material rather than the quality of writing. The style is dense, descriptions are overly brief, and explanations are poorly laid out. Proofs are brief and sketchy. Overall, it is just poor writing. Take a look at Odifreddi to see recursion theory from someone with a talent for readable prose.
It says no previous logic course is assumed, but you actually need set theory and basic logic from the beginning. Also, coverage of the basics is cursory, so it would help to have done something like Cutland. |
| Theory of Recursive Functions and Effective Computability by The MIT Press A Masterpiece |
| 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. |
| Theory of Recursive Functions and Effective Computability by The MIT Press great book |
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) |
| Theory of Recursive Functions and Effective Computability by The MIT Press A classic! |
| 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. |
| Theory of Recursive Functions and Effective Computability by The MIT Press Product Description |
| (Reprint of the 1967 edition) |
No item elements found in rss feed.
