Theoretical Computer Science for the Working Category Theorist

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.

List of contents

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

Summary

This Element presents the usual material taught in a yearlong course of theoretical computer science using the intuitive language and methodology of category theory. Perfect for students or professionals working in computers or physics, or mathematics.

Product details

• Authors: Noson S Yanofsky, Noson S. Yanofsky, Noson S. (Brooklyn College Yanofsky, Yanofsky Noson S.
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Paperback / Softback
• Released: 31.12.2021
• EAN: 9781108792745
• ISBN: 978-1-108-79274-5
• No. of pages: 150
• Series: Elements in Applied Category Theory; Elements in Applied Category T
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > IT; MATHEMATICS / Logic, Mathematical theory of computation, Mathematical foundations