Computability, Complexity & Algorithms
The Power and Limitation of Algorithms
Created by: Charles Brubaker
Quality Score
Content Quality
/
Video Quality
/
Qualified Instructor
/
Course Pace
/
Course Depth & Coverage
/
Overall Score : 0 / 100
Live Chat with CourseDuck's Co-Founder for Help
Need help deciding on a go course? Or looking for more detail on Charles Brubaker's Computability, Complexity & Algorithms? Feel free to chat below.
Join CourseDuck's Online Learning Discord Community
Course Description
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.
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.
0 Reviews 
Reviews
- Price: $0.00 0 Track Price
- Provider:
Udacity - Level:
Advanced - Certificate:
Yes
Udacity Coupon Price Tracker
