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: P, NP, and NP-Completeness: The Basics of Complexity TheoryP, NP, and NP-Completeness: The Basics of Complexity Theory
by - Cambridge University Press
The main focus of the current book is on the P-vs-NP Question and the theory of NP-completeness. Additional topics that are covered include the treatment of the general notion of a reduction between computational problems.
(9435 views)
Book cover: Complexity Theory: A Modern ApproachComplexity Theory: A Modern Approach
by - Cambridge University Press
The book provides an introduction to basic complexity classes, lower bounds on resources required to solve tasks on concrete models such as decision trees or circuits, derandomization and pseudorandomness, proof complexity, quantum computing, etc.
(17799 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.
(6262 views)
Book cover: Mathematics and ComputationMathematics and Computation
by - Princeton University Press
The book provides a broad, conceptual overview of computational complexity theory -- the mathematical study of efficient computation. It is useful for undergraduate and graduate students in mathematics, computer science, and related fields.
(3603 views)