Advanced Search
DSpace@MIT

18.404J / 6.840J Theory of Computation, Fall 2002

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Sipser, Michael
dc.coverage.temporal Fall 2002
dc.date.accessioned 2007-12-07T05:35:09Z
dc.date.available 2007-12-07T05:35:09Z
dc.date.issued 2002-12
dc.identifier 18.404J-Fall2002
dc.identifier.other 18.404J
dc.identifier.other 6.840J
dc.identifier.other IMSCP-MD5-6ea338059dac8bc159125e8444494e71
dc.identifier.uri http://hdl.handle.net/1721.1/39661
dc.description.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. en
dc.language.iso en-US
dc.relation.hasversion http://www.universiabrasil.net/mit/curso.jsp?codcurso=37
dc.relation.hasversion http://mit.ocw.universia.net/18-404JTheory-of-ComputationFall2002/OcwWeb/Mathematics/18-404JTheory-of-ComputationFall2002/CourseHome/index.htm
dc.rights This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. en
dc.subject computability en
dc.subject computational complexity theory en
dc.subject Regular and context-free languages en
dc.subject Decidable and undecidable problems en
dc.subject reducibility en
dc.subject recursive function theory en
dc.subject Time and space measures on computation en
dc.subject completeness en
dc.subject hierarchy theorems en
dc.subject inherently complex problems en
dc.subject oracles en
dc.subject probabilistic computation en
dc.subject interactive proof systems en
dc.subject 18.404J en
dc.subject 6.840J en
dc.subject 18.404 en
dc.subject 6.840 en
dc.title 18.404J / 6.840J Theory of Computation, Fall 2002 en
dc.title.alternative Theory of Computation en
dc.audience.educationlevel Graduate
dc.subject.cip 270303 en
dc.subject.cip Computational Mathematics en


Files in this item

Name Size Format Description
18-404JFall-2002/ ... 15.67Kb HTML

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage