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

Lynch, Nancy

Author(s)

Lynch, Nancy

Download6-045j-spring-2005/contents/index.htm (17.26Kb)

Alternative title

Automata, Computability, and Complexity

Terms of use

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

Metadata

Show full item record

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.

Date issued

2005-06

URI

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

Other identifiers

6.045J-Spring2005

local: 6.045J

local: 18.400J

local: IMSCP-MD5-324856d070bbfc073a8b3f8186e8dd9e

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

DSpace@MIT