Theoretical Computer Science for the Working Category Theorist
Published on 16. February 2022
978-1-108-89067-0 (ISBN)
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.
Reviews / Votes
'As well as having a better understanding of Category Theory, I have a new perspective on theoretical computer science: the subset of functions that comprise computable functions is somewhat ugly to formalise. This is the first in a series of Cambridge Elements: shortish works on Applied Category Theory. This one is highly recommended: I will be looking out for the others.' Susan Stepney, (http://susan-stepney.blogspot.com)More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
College/higher education
Illustrations
Worked examples or Exercises
File size
2,61 MB
ISBN-13
978-1-108-89067-0 (9781108890670)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Noson S. Yanofsky
Theoretical Computer Science for the Working Category Theorist
Book
03/2022
Cambridge University Press
€24.00
Shipment within 15-20 days
Person
Content
1. Introduction; 2. Aide-Memoire for Category Theory; 3. Models of Computation; 4. Computability Theory; 5. Complexity Theory; 6. Diagonal Arguments; 7. Conclusion; References.
