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....
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | UnknownFormat |
Sprache: | eng |
Veröffentlicht: |
Cambridge, United Kingdom, New York, NY, USA, Port Melbourne, Australia, New Delhi, India, Singapore
Cambridge University Press
2022
|
Schriftenreihe: | Cambridge elements applied category theory
|
Schlagworte: | |
Online Zugang: | zbMATH |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
Beschreibung: | 138 Seiten Diagramme |
ISBN: | 9781108792745 978-1-108-79274-5 |