num_pages: 148
description: Using basic category theory (category functor natural transformation etc.) 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 text we meet some of the deepest ideas and theorems of modern computers and mathematics e.g. Turing machines unsolvable problems the PNP question Kurt Gdels incompleteness theorem intractable problems Turings Halting problem and much more. The concepts come alive with many examples and exercises. This short text covers the usual material taught in a year-long course.
language: English
title: Theoretical Computer Science for the Working Category Theorist
publisher: Cambridge University Press