Theoretical computer science for the working category theorist
Author(s)
Bibliographic Information
Theoretical computer science for the working category theorist
（Cambridge elements, Elements in applied category theory / edited by Bob Coecke,
Cambridge University Press, 2022
- : pbk
- Other Title
-
Cambridge elements : applied category theory
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 130-133) and index
Description and Table of Contents
Description
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.
Table of Contents
- 1. Introduction
- 2. Aide-Memoire for Category Theory
- 3. Models of Computation
- 4. Computability Theory
- 5. Complexity Theory
- 6. Diagonal Arguments
- 7. Conclusion
- References.
by "Nielsen BookData"