Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Theoretical Computer Science for the Working Category Theorist, Paperback / softback Book

Theoretical Computer Science for the Working Category Theorist Paperback / softback

Part of the Elements in Applied Category Theory series

Paperback / softback

Only a few left - usually despatched within 24 hours

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

Save 0%

£17.00

£16.85

Only a few left - usually despatched within 24 hours
Add to Basket
Sign in to add to wishlist
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information