6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002
Name
6-045JSpring-2002.zip
Size
1.08 MB
Format
ZIP
Checksum (MD5)
9c7a5c4648a3b73acd3b6522b06e6c86
Author(s)
Rivest, Ronald L.
Alternative Title
Automata, Computability, and Complexity
Date Issued
June 2002
Abstract
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.
Subjects
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
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Persistent DSpace Link
