Theoretical computer science for the working category theorist
著者
書誌事項
Theoretical computer science for the working category theorist
（Cambridge elements, Elements in applied category theory / edited by Bob Coecke,
Cambridge University Press, 2022
- : pbk
- タイトル別名
-
Cambridge elements : applied category theory
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 130-133) and index
内容説明・目次
内容説明
Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Goedel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises.
目次
- 1. Introduction
- 2. Aide-Memoire for Category Theory
- 3. Models of Computation
- 4. Computability Theory
- 5. Complexity Theory
- 6. Diagonal Arguments
- 7. Conclusion
- References.
「Nielsen BookData」 より