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 en_US
dc.coverage.temporal Fall 2002 en_US
dc.date.issued 2002-12
dc.identifier 18.404J-Fall2002
dc.identifier local: 18.404J
dc.identifier local: 6.840J
dc.identifier local: 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_US
dc.language en-US en_US
dc.relation en_US
dc.relation en_US
dc.rights.uri Usage Restrictions: 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_US
dc.subject computability en_US
dc.subject computational complexity theory en_US
dc.subject Regular and context-free languages en_US
dc.subject Decidable and undecidable problems en_US
dc.subject reducibility en_US
dc.subject recursive function theory en_US
dc.subject Time and space measures on computation en_US
dc.subject completeness en_US
dc.subject hierarchy theorems en_US
dc.subject inherently complex problems en_US
dc.subject oracles en_US
dc.subject probabilistic computation en_US
dc.subject interactive proof systems en_US
dc.subject 18.404J en_US
dc.subject 6.840J en_US
dc.subject 18.404 en_US
dc.subject 6.840 en_US
dc.title 18.404J / 6.840J Theory of Computation, Fall 2002 en_US
dc.title.alternative Theory of Computation en_US


Files in this item

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

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage