Computability, Complexity & Algorithms  Georgia Tech
UdacityFree
Important information
 Course
 Online
 When:
Flexible
Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution.
Starts  Location 

Flexible 
Online

What you'll learn on the course
Algorithms  Duality  Maximum Flow  Turing Machines  
Computability 
Course programme
Approx. 0
Built by Join thousands of students Course SummaryThis class is offered as CS6505 at Georgia Tech where it is a part of the Online Masters Degree (OMS). 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 realworld 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 realworld 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 reinventing the wheel.
Prerequisites and RequirementsStudents are expected to have a solid grasp of the basics of discrete mathematics. Discrete Mathematics and Its Applications by Ken Rosen provides an excellent background for this course.
If you answer “no” to any of the following questions, it may be beneficial to acquire background knowledge concurrently or prior to taking the course.
 Can you show that the sum of the first n numbers is n(n+1)/2? Can you give the proof as an induction on n?
 Can you give an O(n log n) algorithm for sorting n numbers?
 Can you describe the difference between breadthfirst and depthfirst search?
 Given an nxn matrix A and an ndimensional vector b, can you give a polynomialtime algorithm to find a vector x such that Ax=b?
See the Technology Requirements for using Udacity.
Syllabus Lesson 1: Computability Languages & Countability
 Turing Machines
 The ChurchTuring Thesis
 Universality
 Undecidability
 P and NP
 NPCompleteness
 NPComplete Problems
 The Golden Ticket
 Dynamic Programming
 Fast Fourier Transform
 Maximum Flow
 Maximum Bipartite Matching
 Linear Programming
 Duality
 Randomized Algorithms
 Approximation Algorithms