Theoretical Computer Science for the Working Category Theorist
Summary
The feel-good place to buy books
Theoretical Computer Science for the Working Category Theorist by Noson S Yanofsky
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 Gö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.| SKU | Unavailable |
| ISBN 13 | 9781108792745 |
| ISBN 10 | 110879274X |
| Title | Theoretical Computer Science for the Working Category Theorist |
| Author | Noson S Yanofsky |
| Series | Elements In Applied Category Theory |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Cambridge University Press |
| Year published | 2022-03-03 |
| Number of pages | 150 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |