COMPUTABILITY. An introduction to recursive function theory. NIGEL CUTLAND. Department of Pure Mathematics, University of Hull. CAMBRIDGE. Citation. Enderton, H. B. Review: Nigel Cutland, Computability. An Introduction to Recursive Function Theory. J. Symbolic Logic 52 (), no. 1, CSComputability/Computability,An Introduction To Recursive Function Theory (Cutland).pdf. aa37c96 on Mar 22, @nausicaasnow nausicaasnow init.
|Published (Last):||3 May 2005|
|PDF File Size:||7.60 Mb|
|ePub File Size:||10.76 Mb|
|Price:||Free* [*Free Regsitration Required]|
This book is an introduction to computability theory or recursion theory as it is traditionally known to mathematicians. It seems that the push to cover more topics is what led to making the introduction of new topics more and more brief. Learn more about Amazon Prime.
Enderton : Review: Nigel Cutland, Computability. An Introduction to Recursive Function Theory
That book is still available from Amazon and appears to be quite difficult, with notably dense page layouts. Therefore, if a reader can understand the first two chapters, they can probably understand Chapters pretty well.
These are questions to which computer scientists must address themselves. On the opposite end of the spectrum, this is a passable but mediocre reference book for recursion theory.
Write a customer review. Amazon Rapids Fun stories for kids on the go. I read this book 12Jun to 30Jul Clean and clearly written, self-contained. For those interested, here is a link to that book: The reader should find more advanced topics, such Godel’s Incompleteness Theorem, the Recursion Theorem’s, and Reducibility to be quite accessible.
You can look up the same topics in Rogers or Odifreddi to get an idea of the interesting things that could have been said.
An Introduction to Recursive Function Theory
Pages with related products. Alexa Actionable Analytics for the Web.
The Rogers text is a quite credible ‘next level’ read for after reading this very good book presently under review. Would you like to tell us about a lower price? Many of those uses are in proofs of theorems, the worst place for them.
Amazon Drive Cloud storage from Amazon. Amazon Renewed Refurbished products with a warranty. One of these items ships sooner than the other.
Amazon Restaurants Food delivery from local restaurants. The later chapters provide an introduction to more advanced topics such as Gildel’s incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation.
Recursively Enumerable Sets and Degrees: English Choose a language for shopping. Set up a giveaway.
Theory of Computability
Customers who viewed this item also viewed. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: This uniqueness of the URM model also means it is independent of the Chomsky hierarchy of language classes that gecursive on those automata just mentioned.
Learn more about Amazon Giveaway. Page 1 of 1 Start over Page 1 of 1.
Theory of Computability
An Introduction to Recursion Tl. Chapter 10 was much more interesting again and somewhat linked back to Chapter 5. Customers who bought this item also bought. It is, however, worth deciding whether you are in the target audience before making a purchase.
See all 9 reviews. These decisions will get annoying if you plan to read bits and pieces rather than learn in sequence according to the author’s presentation.