Search
Now showing items 1-2 of 2
18.404J / 6.840J Theory of Computation, Fall 2002
(2002-12)
A more extensive and theoretical treatment of the material in 6.045J/18.400J, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, ...
6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002
(2002-06)
Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite representation of infinite objects. Finite automata and regular languages. Context-free languages. Turing machines. Partial ...