Mathematics Logo


Theoretical Computer Science

There are two basic subjects on the theory of computational complexity:

  • 18.400J/6.045J (Automata, Computability, and Complexity) is slower paced than 18.404J/6.840J.
  • 18.404J/6.840J (Theory of Computation) is a more extensive and theoretical treatment of the material of 18.400J/6.045J.

Both 18.400J and 18.404J have 18.062J/6.042 as a prerequisite, though 18.404J allows a substitution of 18.200.

The study of algorithms is taken up by

  • 18.410J/6.046J (Design and Analysis of Algorithms), which requires 6.006.

There are two Undergraduate Seminars in this area:

  • 18.424 (Seminar in Information Theory) requiring a subject in probability and a subject in linear algebra.
  • 18.434 (Seminar in Theoretical Computer Science) requiring 18.410J.