Computability, an introduction to recursive function theory
著者
書誌事項
Computability, an introduction to recursive function theory
Cambridge University Press, 1980
- : pbk
大学図書館所蔵 件 / 全52件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. [239]-240
Includes index
内容説明・目次
内容説明
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 Goedel'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 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.
「Nielsen BookData」 より
