|
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 1 (Studies in Logic and the Foundations of Mathematics, Vol. 125) | 
 enlarge | Author: Piergiorgio Odifreddi
Publisher: North Holland
Category: Book
List Price: $85.95
Buy New: $77.35
You Save: $8.60 (10%)
New (14) Used (4) from $77.35
Rating:  2 reviews
Sales Rank: 1150822
Media: Paperback
Pages: 660
Number Of Items: 1
Shipping Weight (lbs): 2.3
Dimensions (in): 8.7 x 5.9 x 1.1
ISBN: 0444894837
Dewey Decimal Number: 511
EAN: 9780444894830
Publication Date: October 1, 1999
Shipping: Eligible for Super Saver Shipping
Availability: Usually ships in 24 hours
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles.Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Goedel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.
|
| Customer Reviews:
 better as a reference book than as a textbook March 9, 2008
a reader (Taipei)
1 out of 1 found this review helpful
I agree with much of what another reviewer has said (July 11, 2005 ). But I don't think that Odifreddi has exaggerated when he claims that the prerequisites of reading his book will be roughly freshman math. Having said that, I admit that since many students in their sophomore year still don't possess a working knowledge of, say proof by mathematical induction, the book is certainly too heavy for those readers. Further aggravating the difficulty for beginners is the book's admittedly less-than-ideal organization and presentation of some portion of the enormously many topics it treats. This will be frustrating for readers who are not enthusiasts of the book's multifarious viewpoints and prefer a quick introduction to the subject instead. I recommend N.Cutland's "Computability" to newcomers. Nevertheless, for those who plan a future career in mathematical logic, especially recursion theory, Odifreddi's book will prove to be a treasure trove of unusual and stimulating insights not easily encountered elsewhere - even though one might not always agree with his ideas. For the future logicians I also recommend R.Soare's "Recursively enumerable sets and degrees" for a deeper treatment of r.e. sets.
 Interesting but very uneven July 12, 2005
Nathan Oakes (Ashland, Oregon)
9 out of 11 found this review helpful
The stated goal of the book is to have no prerequisites other than freshman math, but you really need at least undergrad logic and set theory. It is a thick book and covers a lot of interesting stuff, but there can be a frustrating lack of order and detail. He is an engaging writer, but sloppy in that he gives only part of the information you need to understand something, forgetting that he didn't give it or you don't know it. Sections are often either too sketchy or wordy and unfocused. Sometimes, though, he comes through with an elegant explanation of something. He is at his best when relating recursion theory to science, philosophy, and other branches of math. These discussions tend to be rather handwavy, but he gives references to the literature. The book as a whole is not very unified and it doesn't clearly indentify and relate the central ideas of recursion theory, so it wouldn't make a good introductory text. But it is a good reference for those with a moderate background.
|
|
|
| |
