What Can Be Computed?

A Practical Guide to the Theory of Computation

出版社 Princeton University Press
発売日 2018/05/01
ページ数 408
ISBN-13 9780691170664
お届け日 通常 02月15日~02月22日

通常価格 ¥9,350

税込 配送料は購入手続き時に計算されます。


An accessible and rigorous textbook for introducing undergraduates to computer science theory

What Can Be Computed? is a uniquely accessible yet rigorous introduction to the most profound ideas at the heart of computer science. Crafted specifically for undergraduates who are studying the subject for the first time, and requiring minimal prerequisites, the book focuses on the essential fundamentals of computer science theory and features a practical approach that uses real computer programs (Python and Java) and encourages active experimentation. It is also ideal for self-study and reference.

The book covers the standard topics in the theory of computation, including Turing machines and finite automata, universal computation, nondeterminism, Turing and Karp reductions, undecidability, time-complexity classes such as P and NP, and NP-completeness, including the Cook-Levin Theorem. But the book also provides a broader view of computer science and its historical development, with discussions of Turing’s original 1936 computing machines, the connections between undecidability and G�del’s incompleteness theorem, and Karp’s famous set of twenty-one NP-complete problems.

Throughout, the book recasts traditional computer science concepts by considering how computer programs are used to solve real problems. Standard theorems are stated and proven with full mathematical rigor, but motivation and understanding are enhanced by considering concrete implementations. The book’s examples and other content allow readers to view demonstrations of–and to experiment with–a wide selection of the topics it covers. The result is an ideal text for an introduction to the theory of computation.

  • An accessible and rigorous introduction to the essential fundamentals of computer science theory, written specifically for undergraduates taking introduction to the theory of computation

  • Features a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understanding

  • Gives equal emphasis to computability and complexity

  • Includes special topics that demonstrate the profound nature of key ideas in the theory of computation

  • Lecture slides and Python programs are available at whatcanbecomputed.com

DeepL 粗訳


What Can Be Computed?本書は、この分野を初めて勉強する学部生のために特別に作成されたもので、最低限の前提条件を必要としますが、コンピュータ科学の理論の本質的な基礎に焦点を当て、実際のコンピュータプログラム(PythonとJava)を使用し、積極的な実験を奨励する実践的なアプローチを特徴としています。また、自習や参考書としても最適です。



  • コンピュータ科学の理論の本質的な基礎へのアクセスが容易で厳格な入門書であり、特に計算理論の入門を履修している学部生のために書かれています。また、今後予定されている Java 代替のオンライン) を使用して、モチベーションと理解を高めることができます

  • 計算可能性と複雑性に等しく重点を置いています

  • 計算理論における主要なアイデアの深遠な性質を示す特別なトピックが含まれています

  • 講演スライドと Python プログラムは whatcanbecomputed で利用できます。com