18.404J / 6.840J Theory of Computation, Fall 2002
Theory of Computation
MetadataShow full item record
A more extensive and theoretical treatment of the material in 6.045J/18.400J, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.
computability, computational complexity theory, Regular and context-free languages, Decidable and undecidable problems, reducibility, recursive function theory, Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, interactive proof systems, 18.404J, 6.840J, 18.404, 6.840
Showing items related by title, author, creator and subject.
Sass, Lawrence (2004-06)Explores the role of computer visualization as a representational medium. Visualization is widely used in scientific, engineering, and design disciplines to help people understand complex phenomena and constructs. The key ...
Sass, Lawrence (2006-06)This course introduces students to architectural design and computation through the use of computer modeling, rendering, and digital fabrication. The focus is on the exploration of space and place-making through the use ...
Sass, Lawrence (2005-12)This class serves as an introductory subject in advanced computing, rapid prototyping, and CAD/CAM fabrication for architects. It focuses on the relationship between design and various forms of computer modeling as input, ...