| dc.contributor.author | Rivest, Ronald L. | en_US |
| dc.coverage.temporal | Spring 2002 | en_US |
| dc.date.issued | 2002-06 | |
| dc.identifier | 6.045J-Spring2002 | |
| dc.identifier | local: 6.045J | |
| dc.identifier | local: 18.400J | |
| dc.identifier | local: IMSCP-MD5-28ea8751aa219a34436f9ecd5100991a | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/36867 | |
| dc.description.abstract | Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite representation of infinite objects. Finite automata and regular languages. Context-free languages. Turing machines. Partial recursive functions. Church's Thesis. Undecidability. Reducibility and completeness. Time complexity and NP-completeness. Probabilistic computation. Interactive proof systems. | en_US |
| dc.language | en-US | 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 | automata | en_US |
| dc.subject | computability | en_US |
| dc.subject | complexity | en_US |
| dc.subject | mathematical models | en_US |
| dc.subject | computation | en_US |
| dc.subject | finite representation | en_US |
| dc.subject | infinite objects | en_US |
| dc.subject | finite automata | en_US |
| dc.subject | regular languages | en_US |
| dc.subject | context-free languages | en_US |
| dc.subject | Turing machines | en_US |
| dc.subject | partial recursive functions | en_US |
| dc.subject | Church's Thesis | en_US |
| dc.subject | undecidability | en_US |
| dc.subject | reducibility | en_US |
| dc.subject | completeness | en_US |
| dc.subject | time complexity | en_US |
| dc.subject | NP-completeness | en_US |
| dc.subject | probabilistic computation | en_US |
| dc.subject | interactive proof systems | en_US |
| dc.subject | 6.045J | en_US |
| dc.subject | 18.400J | en_US |
| dc.subject | 6.045 | en_US |
| dc.subject | 18.400 | en_US |
| dc.subject | Computational complexity | en_US |
| dc.title | 6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002 | en_US |
| dc.title.alternative | Automata, Computability, and Complexity | en_US |
