Logo

Computability and Complexity from a Programming Perspective

Large book cover: Computability and Complexity from a Programming Perspective

Computability and Complexity from a Programming Perspective
by

Publisher: The MIT Press
ISBN/ASIN: 0262100649
ISBN-13: 9780262100649
Number of pages: 485

Description:
The author's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems.

Download or read it online for free here:
Download link
(1.7MB, PDF)

Similar books

Book cover: Specifying SystemsSpecifying Systems
by - Addison-Wesley Professional
This book shows how to write unambiguous specifications of complex computer systems. It provides a complete reference manual for the TLA+, the language developed by the author for writing simple and elegant specifications of algorithms and protocols.
(9284 views)
Book cover: Algorithmic Randomness and ComplexityAlgorithmic Randomness and Complexity
by - Springer
Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of algorithmic randomness and complexity for scientists from diverse fields.
(5122 views)
Book cover: Foundations of CryptographyFoundations of Cryptography
by - Cambridge University Press
The book gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs. Throughout, definitions are complete and detailed; proofs are rigorous and given in full.
(10815 views)
Book cover: Communication Complexity (for Algorithm Designers)Communication Complexity (for Algorithm Designers)
by - Stanford University
The two biggest goals of the course are: 1. Learn several canonical problems that have proved the most useful for proving lower bounds; 2. Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.
(1410 views)