subject

Udacity: Computability, Complexity & 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.

Why Take This Course?
You will learn a wealth of tools and techniques that will help you recognize when problems you encounter in the real-world are intractable and when there an efficient solution. This can save you countless hours that otherwise would have been spent on a fruitless endeavor or in re-inventing the wheel.

Syllabus

### 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
FAQ View All
What are MOOCs?
MOOCs stand for Massive Open Online Courses. These are free online courses from universities around the world (eg. Stanford Harvard MIT) offered to anyone with an internet connection.
How do I register?
To register for a course, click on "Go to Class" button on the course page. This will take you to the providers website where you can register for the course.
How do these MOOCs or free online courses work?
MOOCs are designed for an online audience, teaching primarily through short (5-20 min.) pre recorded video lectures, that you watch on weekly schedule when convenient for you.  They also have student discussion forums, homework/assignments, and online quizzes or exams.

1 review for Udacity's Computability, Complexity & Algorithms

Write a review
2 years ago
Marat Minshin is taking this course right now, spending 5 hours a week on it and found the course difficulty to be medium.
Was this review helpful to you? YES | NO

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free