The Power and Limitation of AlgorithmsStart Free Course
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.
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.
This free course is your first step towards a new career with the Machine Learning Engineer Nanodegree Program.
Enhance your skill set and boost your hirability through innovative, independent learning.
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.
Get notified when the Computability, Complexity & Algorithms course launches.
We'll be in touch soon.
Besuchen Sie de.udacity.com und entdecken Sie lokale Angebote, unsere Partnerunternehmen und Udacitys deutschsprachigen Blog.