Placeholder text

Go to cart

Theoretical Computer Science for the Working Category Theorist

By Yanofsky, Noson S

Theoretical Computer Science for the Working Category Theorist

By Yanofsky, Noson S

0 - Default Title
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 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.
Product details
Binding:
Paperback
Number of Pages:
148
Release Date:
2022-03-03
Publication Date:
2022-03-03
Publisher:
Cambridge University Press
Languages:
Original: English
ISBN10:
110879274X
ISBN13:
9781108792745
GPSR Manufacturer Reference:
[email protected]
Weight:
210 g
Height:
145 cm
Width:
225 cm
Thickness:
9 cm
Buy on Amazon
Currently sold out