Computability, Complexity & Algorithms
About this 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 …
Computability, Complexity & Algorithms
About this 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.
Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution.
[
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.
]
lesson 1
Computability
Languages & Countability
Turing Machines
The Church-Turing Thesis
lesson 2
Complexity
P and NP
NP-Complete Problems
The Golden Ticket
lesson 3
Algorithms
Dynamic Programming
Fast Fourier Transform
Maximum Flow
