Computability: An Introduction to Recursive Function Theory - Hardcover
What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. 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: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. 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. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.
"synopsis" may belong to another edition of this title.
Book Description:
This introduction to recursive theory computability begins with a mathematical characterization of computable functions, develops the mathematical theory and includes a full discussion of noncomputability and undecidability. Later chapters move on to more advanced topics such as degrees of unsolvability and Gödel's Incompleteness Theorem.
Review:
"Dr. Cutland has produced here an excellent and much needed textbook which will undoubtedly help to establish recursion theory as a more widely taught branch of mainstream mathematics." Mathematics & Physics
"About this title" may belong to another edition of this title.
- PublisherCambridge University Press
- Publication date1980
- ISBN 10 0521223849
- ISBN 13 9780521223843
- BindingHardcover
- Number of pages264
- Rating
Top Search Results from the AbeBooks Marketplace
Stock Image
Computability: An Introduction to Recursive Function Theory
Published by
Cambridge University Press
(1980)
ISBN 10: 0521223849
ISBN 13: 9780521223843
Used
Hardcover
Quantity: 1
Seller:
Rating
Book Description Condition: Fair. Buy with confidence! Book is in acceptable condition with wear to the pages, binding, and some marks within. Seller Inventory # bk0521223849xvz189zvxacp
Buy Used
US$ 81.52
Convert currency
Stock Image
Computability: An Introduction to Recursive Function Theory
Published by
Cambridge University Press
(1980)
ISBN 10: 0521223849
ISBN 13: 9780521223843
Used
Hardcover
Quantity: 1
Seller:
Rating
Book Description hardcover. Condition: Acceptable. This item is fairly worn, but continues to work perfectly. Signs of wear can include aesthetic issues such as scratches, dents, worn corners, bends, tears, small stains, and partial water damage. All pages and the cover are intact, but the dust cover may be missing, if applicable. Pages may include excessive notes and highlighting, but the text is not obscured or unreadable. Satisfaction Guaranteed. Seller Inventory # 4BQGBJ00T7JI_ns
Buy Used
US$ 81.55
Convert currency