Automata, Computability, and Complexity

Diagram showing transitions between four states.

Lecture 3 introduces finite automata and provides several examples; this one includes a trap state, state d. (Image by MIT OpenCourseWare.)

Instructor(s)

MIT Course Number

6.045J / 18.400J

As Taught In

Spring 2011

Level

Undergraduate

Cite This Course

Course Features

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

Aaronson, Scott. 6.045J Automata, Computability, and Complexity, Spring 2011. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-045j-automata-computability-and-complexity-spring-2011 (Accessed). License: Creative Commons BY-NC-SA


For more information about using these materials and the Creative Commons license, see our Terms of Use.


Close