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

Title:	6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002
Author:	Rivest, Ronald L.
Issue Date:	2002-06
Abstract:	Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite representation of infinite objects. 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. Interactive proof systems.
URI:	http://hdl.handle.net/1721.1/36867
Other Identifiers:	6.045J-Spring2002
Other Identifiers:	6.045J 18.400J IMSCP-MD5-28ea8751aa219a34436f9ecd5100991a
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, 18.400J, 6.045, 18.400, Computational complexity, 110101, Computer and Information Sciences, General

Files in this item

Files	Size	Format	View
6-045JSpring-20 ... g2002/CourseHome/index.htm	15.28Kb	HTML	View/Open

The following license files are associated with this item: