# Introduction to Complexity and Computability

*unavailable*

*unavailable*

This is a basic course on the theory of algorithms, computability and computational complexity. Roughly the first half of the course is devoted to the introduction to computability theory: Turing machines. Computable functions. Recursive and recursively enumerable languages and sets. Undecidable problems. The second half of the course is devoted to the study of space and time complexity classes: Equivalence of PSPACE and NPSPACE. Deterministic hierarchy theorems. Class NP. Polynomial reducibility among problems. Proofs of NP- completeness. Approximation algorithms and approximation schemes.

##### Relations

In theoretical computer science and mathematics, the theory of computation is the branch that deals w...

follows Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak

This is a textbook on computational complexity theory. It is intended as a text for an advanced under...

follows Introduction to the Theory of Computation, 3rd edition

Gain a clear understanding of even the most complex, highly theoretical computational theory topics i...

Edit details Edit relations Attach new author Attach new topic Attach new resource

##### from 2 reviews

- Resource level 3.5 /10
- beginner intermediate advanced
- Resource clarity 6.0 /10
- hardly clear sometimes unclear perfectly clear
- Reviewer's background 3.5 /10
- none basics intermediate advanced expert

##### Comments 2

6 rating 4 level 5 clarity 4 user's background

9 rating 3 level 7 clarity 3 user's background