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

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

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,...

Full description

Bibliographic Details
Main Author: Lynch, Nancy
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Learning Object
Language:en-US
Published: 2005
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
Online Access:http://hdl.handle.net/1721.1/68649

Internet

http://hdl.handle.net/1721.1/68649

Similar Items