Show simple item record

6.045J / 18.400J Automata, Computability, and Complexity, Spring 2005

dc.contributor.authorLynch, Nancyen_US
dc.coverage.temporalSpring 2005en_US
dc.date.issued2005-06
dc.identifier6.045J-Spring2005
dc.identifierlocal: 6.045J
dc.identifierlocal: 18.400J
dc.identifierlocal: IMSCP-MD5-324856d070bbfc073a8b3f8186e8dd9e
dc.identifier.urihttp://hdl.handle.net/1721.1/68649
dc.description.abstractThis course is offered to undergraduates and introduces basic mathematical models of computation and the finite representation of infinite objects. The course is slower paced than 6.840J/18.404J. Topics covered include: 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, and interactive proof systems.en_US
dc.languageen-USen_US
dc.relationen_US
dc.relationen_US
dc.relationen_US
dc.relationen_US
dc.rights.uriUsage Restrictions: This site (c) Massachusetts Institute of Technology 2012. 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_US
dc.subjectautomataen_US
dc.subjectcomputabilityen_US
dc.subjectcomplexityen_US
dc.subjectmathematical modelsen_US
dc.subjectcomputationen_US
dc.subjectfinite representationen_US
dc.subjectinfinite objectsen_US
dc.subjectfinite automataen_US
dc.subjectregular languagesen_US
dc.subjectcontext-free languagesen_US
dc.subjectTuring machinesen_US
dc.subjectpartial recursive functionsen_US
dc.subjectChurch's Thesisen_US
dc.subjectundecidabilityen_US
dc.subjectreducibilityen_US
dc.subjectcompletenessen_US
dc.subjecttime complexityen_US
dc.subjectNP-completenessen_US
dc.subjectprobabilistic computationen_US
dc.subjectinteractive proof systemsen_US
dc.subject6.045Jen_US
dc.subject6.045en_US
dc.subject18.400Jen_US
dc.subject18.400en_US
dc.title6.045J / 18.400J Automata, Computability, and Complexity, Spring 2005en_US
dc.title.alternativeAutomata, Computability, and Complexityen_US
dc.typeLearning Object
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics


Files in this item

Thumbnail
Name:
6-045j-spring-2005/contents/in ...
Size:
17.26Kb
Format:
HTML
View/Open

This item appears in the following Collection(s)

Show simple item record