Books > Science & Mathematics > Mathematics > Mathematical foundations
|
Buy Now
Theoretical Computer Science for the Working Category Theorist (Paperback, New Ed)
Loot Price: R634
Discovery Miles 6 340
|
|
Theoretical Computer Science for the Working Category Theorist (Paperback, New Ed)
Series: Elements in Applied Category Theory
Expected to ship within 12 - 19 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.