A first course in computability
著者
書誌事項
A first course in computability
（Computer science texts / consulting editors K.J. Bowcock, Dr. A.M. Gibbons, M.C. Henson）
Blackwell Scientific, 1986
大学図書館所蔵 件 / 全9件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. 175-177
Includes index
内容説明・目次
内容説明
This book is designed on similar lines to the same author's "A First Course in Formal Language Theory". Together with this and "A First Course in Formal Logic and its Applications in Computer Science" by R.D. Dowsing et al., it is aimed at first- and second-year undergraduates with the intention of covering the formal theory required at the start of an honours degree in computing. This text covers the classic material on computability using Turing machines. The reader is led into the more recent results concerning complexity classes and the important work on NP-completeness and PSPACE-completeness. Emphasis is placed on clear and well motivated exposition, and numerous exercises are included.
目次
- Mathematical prerequisites
- Turing machines
- solvability and unsolvability
- formal languages
- recursive functions
- complexity theory
- appendix - the Turing machine simulator.
「Nielsen BookData」 より