This is an archived course. A more recent version may be available at ocw.mit.edu.

Advanced Search
    Translations*
    Archived Versions
    Home > Courses > Electrical Engineering and Computer Science > Automata, Computability, and Complexity

    Automata, Computability, and Complexity

    As taught in: Spring 2005

    P=NP?

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

    Instructors:

    Prof. Nancy Lynch

    MIT Course Number:

    6.045J / 18.400J

    Level:

    Undergraduate

    Course Features

    Course Highlights

    The recitation section includes many practice problems. 6.045J is a course in the department's "Theoretical Computer Science" concentration.

    Course Description

    This course is offered to undergraduates and introduces basic mathematical models of computation and the finite representation of infinite objects. The course is slower paced than 6.840J/18.404J. 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.


    *Some translations represent previous versions of courses.