Theoretical Computer Science for the Working Category Theorist

AvNoson S. Yanofsky

Häftad, Engelska, 2022

Del i serien Elements in Applied Category Theory

240 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

E-bok

287 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2022-03-03
Mått:152 x 228 x 9 mm
Vikt:230 g
Format:Häftad
Språk:Engelska
Serie:Elements in Applied Category Theory
Antal sidor:148
Förlag:Cambridge University Press
ISBN:9781108792745

Utforska kategorier

Matematikens grunder inom Naturvetenskap och teknik

Recensioner i media

'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)

Innehållsförteckning

1. Introduction; 2. Aide-Mémoire for Category Theory; 3. Models of Computation; 4. Computability Theory; 5. Complexity Theory; 6. Diagonal Arguments; 7. Conclusion; References.