YoVDO

Computability, Complexity & Algorithms

Offered By: Georgia Institute of Technology via Udacity

Tags

Algorithms and Data Structures Courses Algorithms Courses Turing Machines Courses NP-Complete Problems Courses Dynamic programming Courses Computability Courses Complexity Courses Fast Fourier Transform Courses

Course Description

Overview

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.


Syllabus

  • Computability
    • Languages & Countability,Turing Machines,The Church-Turing Thesis
  • Complexity
    • P and NP,NP-Complete Problems,The Golden Ticket
  • Algorithms
    • Dynamic Programming,Fast Fourier Transform,Maximum Flow

Taught by

Hariharan Venkateswaran and Lance Fortnow

Tags

Related Courses

Automata Theory
Stanford University via edX Advanced Algorithms and Complexity
University of California, San Diego via Coursera NP-Complete Problems
University of California, San Diego via edX Razonamiento artificial
Universidad Nacional Autónoma de México via Coursera Algorithms and Data Structures
University of California, San Diego via edX