| dc.contributor.author | Sipser, Michael | |
| dc.coverage.temporal | Fall 2006 | |
| dc.date.accessioned | 2021-11-02T18:53:09Z | |
| dc.date.available | 2021-11-02T18:53:09Z | |
| dc.date.issued | 2006-12 | |
| dc.identifier | 18.404J-Fall2006 | |
| dc.identifier.other | 18.404J | |
| dc.identifier.other | 6.840J | |
| dc.identifier.other | IMSCP-MD5-f2c81ea1b25ab05755329f70da5d3c82 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/137168 | |
| dc.description.abstract | This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory. | en |
| dc.language.iso | en-US | |
| dc.relation.isbasedon | http://hdl.handle.net/1721.1/39661 | |
| dc.rights | This site (c) Massachusetts Institute of Technology 2021. 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") unless otherwise noted. 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.rights | Attribution-NonCommercial-ShareAlike 3.0 Unported | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | * |
| dc.subject | Computability, computational complexity theory | en |
| dc.subject | Regular and context-free languages | en |
| dc.subject | Decidable and undecidable problems, reducibility, recursive function theory | en |
| dc.subject | Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems | en |
| dc.title | 18.404J / 6.840J Theory of Computation, Fall 2006 | en |
| dc.title.alternative | Theory of Computation | en |
| dc.audience.educationlevel | Graduate | |
| dc.subject.cip | 270303 | en |
| dc.subject.cip | Computational Mathematics | en |
| dc.date.updated | 2021-11-02T18:53:17Z | |
