## Computability, Complexity & Algorithms

### Lesson 1: Computability * Languages & Countability * Turing Machines * The Church-Turing Thesis * Universality * Undecidability ### Lesson 2: Complexity * P and NP * NP-Completeness * NP-Complete Problems * The Golden Ticket ### Lesson 3: Algorithms * Dynamic Programming * Fast Fourier Transform * Maximum Flow * Maximum Bipartite Matching * Linear Programming * Duality * Randomized Algorithms * Approximation Algorithms

*This class is offered as CS6505 at Georgia Tech where it is a part of the [Online Masters Degree (OMS)](http://www.omscs.gatech.edu/). Taking this course here will not earn credit towards the OMS degree.*
In this course, we will ask the big questions, “What is a computer? What are the limits of computation? Are there problems that no computer will ever solve? Are there problems that can’t be solved quickly? What kinds of problems can we solve efficiently and how do we go about developing these algorithms?” Understanding the power and limitations of algorithms helps us develop the tools to make real-world computers smarter, faster and safer.