MIT OpenCourseWare
  • OCW home
  • Course List
  • about OCW
  • Help
  • Feedback
    • Support MIT OCW

 » MIT OpenCourseWare » Electrical Engineering and Computer Science » Automata, Computability, and Complexity, Spring 2002

6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002

An NP completeness problem and one of the most important unsolved questions in modern mathematics.
An NP completeness problem. "Does P equal NP?" is one of the most important unsolved questions in modern mathematics. (Image courtesy of MIT OCW.)

Highlights of this Course

6.045J is a course in the department's "Theoretical Computer Science" concentration. This course has virtually all of its materials online, including a full set of homework assignments and exams.

 >> View this course en Español or em Portugues courtesy of Universia.

Course Description

This course introduces basic mathematical models of computation and the finite representation of infinite objects. Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.

 

Staff

Instructor:
Prof. Ronald Rivest

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Recitations:
One session / week
1 hour / session

Level

Undergraduate

Feedback

Send feedback about OCW or this course.

Creative Commons - some rights reserved

Your use of the MIT OpenCourseWare site and course materials is subject to the conditions and terms of use in our Legal Notices section.