Average Reviews:
(More customer reviews)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.
Click Here to see more reviews about: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)
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.
No comments:
Post a Comment