Computability: A Mathematical Sketchbook: v. 146 (Graduate Texts in Mathematics)


Product Description
Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.Computability: A Mathematical Sketchbook: v. 146 (Graduate Texts in Mathematics) Review
For the THEORETICAL COMPUTER SCIENTIST, calculability is the foundations that will lead to complexity considerations...For those liking a rigouros approach (for example with a mathematical background) , this book is just what they need...MATHEMATICIANS should all find great pleasure in reading at least once in there life something about undecidable problems...(Yes there are some! ), and things such as: are real numbers just an illusion? etc...People interested in the alternative "KLEEN FUNCTIONS" approach to calculability (instead of the classical TM approach or lambda calculus) will be delighted too...(Those accustumed with the TM approch will only like it more, but the book is absolutely complete in it's self...) Help other customers find the most helpful reviews Was this review helpful to you?�Yes No Report abuse | PermalinkComment�CommentMost of the consumer Reviews tell that the "Computability: A Mathematical Sketchbook: v. 146 (Graduate Texts in Mathematics)" are high quality item. You can read each testimony from consumers to find out cons and pros from Computability: A Mathematical Sketchbook: v. 146 (Graduate Texts in Mathematics) ...

No comments:
Post a Comment