Email RIS file
Bookmark
Report an Issue

Theoretical computer science for the working category theorist / Noson S. Yanofsky

Author
Yanofsky, Noson S., 1967-
Published
Cambridge : Cambridge University Press, 2022.
Physical Description
1 online resource (138 pages) : digital, PDF file(s).
Access Online

Availability

I Want It
I Want It

Finding items...

Series
Summary
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.
Subject(s)
ISBN
9781108872348 (ebook)
9781108792745 (paperback)
Note
Title from publisher's bibliographic system (viewed on 25 Jan 2022).
View MARC record | catkey: 36533731