Theoretical Computer Science for the Working Category Theorist Paperback / softback
by Noson S. (Brooklyn College, City University of New York) Yanofsky
Part of the Elements in Applied Category Theory series
Paperback / softback
- Information
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 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.
Information
-
In Stock - low on stock, only 1 copy remainingFree UK DeliveryEstimated delivery 2-3 working days
- Format:Paperback / softback
- Pages:150 pages, Worked examples or Exercises
- Publisher:Cambridge University Press
- Publication Date:03/03/2022
- Category:
- ISBN:9781108792745
Information
-
In Stock - low on stock, only 1 copy remainingFree UK DeliveryEstimated delivery 2-3 working days
- Format:Paperback / softback
- Pages:150 pages, Worked examples or Exercises
- Publisher:Cambridge University Press
- Publication Date:03/03/2022
- Category:
- ISBN:9781108792745