Theoretical Computer Science for the Working Category Theorist

Noson S. Yanofsky (Brooklyn College, City University of New York)

$32.95

Paperback

In stock
Ready to ship

QTY:

English

Cambridge University Press
03 March 2022

Mathematics & Sciences; Mathematical foundations; Mathematical theory of computation

Series: Elements in Applied Category Theory

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.

By: Noson S. Yanofsky (Brooklyn College City University of New York)
Imprint: Cambridge University Press
Country of Publication: United Kingdom
Edition: New edition
Dimensions: Height: 228mm, Width: 152mm, Spine: 9mm
Weight: 230g
ISBN: 9781108792745
ISBN 10: 110879274X
Series: Elements in Applied Category Theory
Pages: 150
Publication Date: 03 March 2022
Audience: College/higher education , Primary
Format: Paperback
Publisher's Status: Active

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