18.404J / 6.840J Theory of Computation, Fall 2002

Title:	18.404J / 6.840J Theory of Computation, Fall 2002
Author:	Sipser, Michael
Issue Date:	2002-12
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.
URI:	http://hdl.handle.net/1721.1/39661
Other Identifiers:	18.404J-Fall2002
Other Identifiers:	18.404J 6.840J IMSCP-MD5-6ea338059dac8bc159125e8444494e71
Has Version	http://www.universiabrasil.net/mit/curso.jsp?codcurso=37 http://mit.ocw.universia.net/18-404JTheory-of-ComputationFall2002/OcwWeb/Mathematics/18-404JTheory-of-ComputationFall2002/CourseHome/index.htm
Keywords:	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, 270303, Computational Mathematics

Files in this item

Files	Size	Format
18-404JFall-200 ... l2002/CourseHome/index.htm	16.05Kb	text/html

The following license files are associated with this item: