Computability - Nigel Cutland

Computability

An Introduction to Recursive Function Theory

(Autor)

Buch | Softcover
264 Seiten
1980
Cambridge University Press (Verlag)
978-0-521-29465-2 (ISBN)
64,80 inkl. MwSt
What can computers do in principle? What are their inherent theoretical limitations? 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 - a function whose values can be calculated in an automatic way. This book is an introduction to computability (recursive) theory.
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 Gödel'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.

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 Gödel'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.

Erscheint lt. Verlag 19.6.1980
Zusatzinfo Worked examples or Exercises
Verlagsort Cambridge
Sprache englisch
Maße 152 x 231 mm
Gewicht 410 g
Themenwelt Informatik Office Programme Outlook
Mathematik / Informatik Mathematik Allgemeines / Lexika
ISBN-10 0-521-29465-7 / 0521294657
ISBN-13 978-0-521-29465-2 / 9780521294652
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich