Publisher | Cambridge University Press |
ISBN 10 | 110879274X |
Book Format | Paperback |
Book 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 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. |
Number of Pages | 150 pages |
ISBN 13 | 9781108792745 |
Author | Noson S. Yanofsky |
Language | English |
Publication Date | 2022-03-03 |
We're Always Here To Help
Reach out to us through any of these support channels
electronics
mobilestabletslaptopshome appliancescamera, photo & videotelevisionsheadphonesvideo gamesfashion
women's fashionmen's fashiongirls' fashionboys' fashionwatchesjewellerywomen's handbagsmen's eyewearhome and kitchen
bathhome decorkitchen & diningTools & Home Improvementaudio & videofurniturePatio, Lawn & Gardenpet suppliesbeauty
fragrancemake-uphaircareskincareBath & Body Electronic beauty toolsmen's groomingHealth Care Essentials