Theoretical computer science for the working category theorist /
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....
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge ; New York :
Cambridge University Press,
2022.
|
| Series: | Cambridge elements. Elements in applied category theory
|
| Subjects: |
| Summary: | 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 Go�del's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem and much more. The concepts come alive with many examples and exercises. |
|---|---|
| Physical Description: | 138 pages : illustrations ; 23 cm. |
| Bibliography: | Includes bibliographical references (pages 130-133) and index. |
| ISBN: | 110879274X 9781108792745 |