Theoretical Computer Science for the Working Category Theorist
Noson S. Yanofsky (Brooklyn College, City University of New York)
Theoretical Computer Science for the Working Category Theorist
Noson S. Yanofsky (Brooklyn College, City University of New York)
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 Goedel’s incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing’s Halting problem, and much more. The concepts come alive with many examples and exercises.
This item is not currently in-stock. It can be ordered online and is expected to ship in approx 2 weeks
Our stock data is updated periodically, and availability may change throughout the day for in-demand items. Please call the relevant shop for the most current stock information. Prices are subject to change without notice.
Sign in or become a Readings Member to add this title to a wishlist.