6.045J / 18.400J Automata, Computability, and Complexity, Spring 2005
Name
6-045j-spring-2005/contents/index.htm
Size
17.26 KB
Format
HTML
Checksum (MD5)
ef9bdbdf6ef0d11aa1c6467bb9a12c29
Author(s)
Lynch, Nancy A.
Alternative Title
Automata, Computability, and Complexity
Date Issued
June 2005
Abstract
This 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.
Subjects
automata
computability
complexity
mathematical models
computation
finite representation
infinite objects
finite automata
regular languages
context-free languages
Turing machines
partial recursive functions
Church's Thesis
undecidability
reducibility
completeness
time complexity
NP-completeness
probabilistic computation
interactive proof systems
6.045J
6.045
18.400J
18.400
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Persistent DSpace Link
