Computability, Complexity & Algorithms

The Power and Limitation of Algorithms

0.0
( 0 Reviews )

Created by: Charles Brubaker

icon
Quality Score

Content Quality
/
Video Quality
/
Qualified Instructor
/
Course Pace
/
Course Depth & Coverage
/

Overall Score : 0 / 100

icon
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.
Advanced Advanced Level

icon
Instructor Details

placeholder

icon
More courses by Charles Brubaker

GT - Refresher - Advanced OS

$0.00

All courses by Charles Brubaker

icon
More go courses

Web Development w/ Google's Go (golang) Programming Language

$11.99

Master Golang Programming:The Complete 2021 Go Bootcamp

$11.99

Go (Golang): The Complete Bootcamp [Updated: December 2021]

$11.99

Linux Administration Bootcamp: Go from Beginner to Advanced

$11.99

Golang - The ultimate guide to microservices in Go [Part 1]

$11.99

Go Programming by Example (Golang)

$11.99

All go courses

icon
Reviews

0.0

0 total reviews

5 star 4 star 3 star 2 star 1 star
% Complete
% Complete
% Complete
% Complete
% Complete
Reset Filter
Write a Review arrow

No reviews yet. Be the first to review this course!

Load More

Computability, Complexity & Algorithms
Visit Course Write a Review
  • Price: $0.00 0 Track Price
  • Provider: icon Udacity
  • Level: Advanced Advanced
  • Certificate: icon Yes

Udacity Coupon Price Tracker

For any issues or feature requests please email CourseDuck's Co-Founder at michaelk@courseduck.com