How does Fishpond Work?

Shop over a million Toys in our Huge New Range

Computability
By

Rating
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.
Product Details

Table of Contents

Preface; Prologue, prerequisites and notation; 1. Computable functions; 2. Generating computable functions; 3. Other approaches to computability: Church's thesis; 4. Numbering computable functions; 5. Universal programs; 6. Decidability, undecidability and partical decidability; 7. Recursive and recursively enumerable sets; 8. Arithmetic and Goedel's incompleteness theorem; 9. Reducibility and degrees; 10. Effective operations on partial functions; 11. The second recursion theorem; 12. Complexity of computation; 13. Further study.

Reviews

"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

Look for similar items by category
People also searched for
How Fishpond Works
Fishpond works with suppliers all over the world to bring you a huge selection of products, really great prices, and delivery included on over 25 million products that we sell. We do our best every day to make Fishpond an awesome place for customers to shop and get what they want — all at the best prices online.
Webmasters, Bloggers & Website Owners
You can earn a 5% commission by selling Computability: An Introduction to Recursive Function Theory on your website. It's easy to get started - we will give you example code. After you're set-up, your website can earn you money while you work, play or even sleep! You should start right now!
Authors / Publishers
Are you the Author or Publisher of a book? Or the manufacturer of one of the millions of products that we sell. You can improve sales and grow your revenue by submitting additional information on this title. The better the information we have about a product, the more we will sell!
Item ships from and is sold by Fishpond World Ltd.
Back to top