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

Home
→
MIT OpenCourseWare (MIT OCW) - Archived Content
→
MIT OCW Archived Courses
→
Electrical Engineering and Computer Science (6) -
→
View Item

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

Alternative Title: Automata, Computability, and Complexity

Author: Lynch, Nancy

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

Date Issued: 2005-06

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.

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

Other Identifiers: 6.045J-Spring2005

Other Identifiers: 6.045J
18.400J
IMSCP-MD5-324856d070bbfc073a8b3f8186e8dd9e

Has Version: http://mit.universia.com.br/curso.jsp?codcurso=70
http://mit.ocw.universia.net/6.045J/OcwWeb/Electrical-Engineering-and-Computer-Science/6-045JAutomata--Computability--and-ComplexitySpring2002/CourseHome/index.htm
http://www.core.org.cn/OcwWeb/Electrical-Engineering-and-Computer-Science/6-045JSpring-2005/CourseHome/index.htm

Is Based On: http://hdl.handle.net/1721.1/36867

Keywords: 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, 110101, Computer and Information Sciences, General, 270303, Computational Mathematics

Show full item metadata