6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002
Author(s)Rivest, Ronald L.
Automata, Computability, and Complexity
MetadataShow full item record
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 recursive functions. Church's Thesis. Undecidability. Reducibility and completeness. Time complexity and NP-completeness. Probabilistic computation. Interactive proof systems.
automata, computability, complexity, mathematical models, computation, finite representation, infinite objects, finite automata, regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility, completeness, time complexity, NP-completeness, probabilistic computation, interactive proof systems, 6.045J, 18.400J, 6.045, 18.400, Computational complexity