Main Profile

At A Glance

Automata, Computability, and Complexity

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 cann...

Start Date: Feb 01, 2011 Topics: Computer Science
Cost: Free

Contact

Automata, Computability, and Complexity's Full Profile

Overview

Description

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.

Details

  • Dates: Feb 01, 2011 to May 25, 2011
  • Days of the Week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
  • Level of Difficulty: Beginner
  • Size: Massive Open Online Course
  • Instructor: Prof. Scott Aaronson
  • Cost: Free
  • Institution: MIT OCW
  • Topics: Computer Science

Provider Overview

About MIT OCW: MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.

Latest Tweet

MIT OCW Offers Courses In: Computer

Questions about Automata, Computability, and Complexity

Want more info about Automata, Computability, and Complexity? Get free advice from education experts and Noodle community members.

  • Answer