Theoretical Computer Science for the Working Category Theorist (Elements in Applied Category Theory)
4.9 (16 items)
Limited Time SaleUS$12.08 cheaper than the new price!!
Free cash-on-delivery fees for purchases over $99
Product details
| Management number | 236848579 | Release Date | 2026/07/10 | List Price | US$8.05 | Model Number | 236848579 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
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. Read more
| ISBN10 | 110879274X |
|---|---|
| ISBN13 | 978-1108792745 |
| Edition | New |
| Language | English |
| Publisher | Cambridge University Press |
| Dimensions | 6 x 0.34 x 9 inches |
| Item Weight | 8.1 ounces |
| Print length | 148 pages |
| Publication date | March 3, 2022 |
Bestseller ranking
Economic History
Customers who viewed this product also viewed
Logic
Correction of product information
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form