Automata, Computability, and Complexity

Automata, Computability, and Complexity


Take This Course Free

by Massachusetts Institute of Technology

This course provides a challenging introduction to some of the central ideas of theoretical computer science. Beginning in antiquity, the course will progress through finite automata, circuits and decision trees, Turing machines and computability, efficient algorithms and reducibility, the P versus NP problem, NP-completeness, the power of randomness, cryptography and one-way functions, computational learning theory, and quantum computing. It examines the classes of problems that can and cannot be solved by various kinds of machines. It tries to explain the key differences between computational models that affect their power.



License:


Source: Massachusetts Institute of Technology

MODULE 1: Lectures

View All Users Who Viewed This Course Also Viewed

Automata, Computability, and Complexity
Massachusetts Institute of Technology

Massachusetts Institute of Technology

Other Courses from Massachusetts Institute of Technology

Average Rating: 0 Reviews
 
Average Rating:

Reviews

  • No Reviews Found
You need to take this course before viewing its lesson.
Take This Course Free