Theoretical Computer Science for the Working Category Theorist

Theoretical Computer Science for the Working Category Theorist 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. Categories:
Computers – Computer Science
Year:
2022
Edition:
New
Publisher:
Cambridge University Press
Language:
english
Pages:
15 148
ISBN 10:
110879274X
ISBN 13:
9781108792745
Series:
Elements in Applied Category Theory
File:
17 MB