18.404J / 6.840J Theory of Computation, Fall 2002
Name
18-404JFall-2002/OcwWeb/Mathematics/18-404JTheory-of-ComputationFall2002/CourseHome/index.htm
Size
15.69 KB
Format
HTML
Checksum (MD5)
194d5c2f41d5c6e91a6a1ba51efd7b51
Author(s)
Sipser, Michael
Alternative Title
Theory of Computation
Date Issued
December 2002
Abstract
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, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.
Subjects
computability
computational complexity theory
Regular and context-free languages
Decidable and undecidable problems
reducibility
recursive function theory
Time and space measures on computation
completeness
hierarchy theorems
inherently complex problems
oracles
probabilistic computation
interactive proof systems
18.404J
6.840J
18.404
6.840
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Persistent DSpace Link
