Computability, Complexity & Algorithms

Online Course

Computability, Complexity & Algorithms

What is the course about?

Computability, Complexity & Algorithms
The course Computability, Complexity & Algorithms is an online class provided by Udacity. The skill level of the course is Advanced. It may be possible to receive a verified certification or use the course to prepare for a degree.

This 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.

Course description
  • Computability, Complexity & Algorithms
  • The Power and Limitation of Algorithms
  • 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.
  • Computability
  • Complexity
  • Algorithms
  • Languages & Countability
  • Turing Machines
  • The Church-Turing Thesis
  • P and NP
  • NP-Complete Problems
  • The Golden Ticket
  • Dynamic Programming
  • Fast Fourier Transform
  • Maximum Flow
  • Students 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.
  • See the Technology Requirements for using Udacity.
  • 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.

Prerequisites & Facts

Computability, Complexity & Algorithms

Course Topic

Machine Learning

University, College, Institution


Course Skill Level


Course Language


Place of class

Online, self-paced (see curriculum for more information)



Degree & Cost

Computability, Complexity & Algorithms

To obtain a verified certificate from Udacity you have to finish this course or the latest version of it, if there is a new edition. The class may be free of charge, but there could be some cost to receive a verified certificate or to access the learning materials. The specifics of the course may have been changed, please consult the provider to get the latest quotes and news.
Computability, Complexity & Algorithms
provided by Udacity


Share your experience

Computability, Complexity & Algorithms
Udacity Udacity
Rate the course

Do you recommend the course? *
Here you can find information, reviews and user experiences for the course “Computability, Complexity & Algorithms“. The provider of the course – “Udacity” – will be glad to answer any questions you may have about the class, click here to use the offical support channels. It would be great if you could share your experience of participating in the course – Your honest review will surely help others to choose the right class!
School: Udacity
Topic: Machine Learning