Material Detail

18.404J Theory of Computation | Mathematics

This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.

Keywords:: Time and space measures on computation, Computability, recursive function theory, Theory of Computation, inherently complex problems, probabilistic computation, hierarchy theorems, and interactive proof systems, Discrete Mathematics, computational complexity theory, Decidable and undecidable problems, completeness, oracles, reducibility, Regular and context-free languages

Disciplines:

Mathematics and Statistics / Mathematics

Go to Material

Bookmark / Add to Course ePortfolio

Create a Learning Exercise

Add Accessibility Information

Rate

Add a Comment

Quality

User Rating
Comments
Learning Exercises
Bookmark Collections
Course ePortfolios
Accessibility Info

Report Broken Link
Report as Inappropriate

More about this material

Material Type:: Online Course
Date Added to MERLOT:: May 12, 2016
Date Modified in MERLOT:: May 12, 2016
Author:: Unknown (Know the author?)
Submitter:: Barbra Bied Sperling

Primary Audience:: Graduate School
Technical Format:: Website
Mobile Compatibility:: Not specified at this time
Language:: English
Cost Involved:: No
Source Code Available:: No
Creative Commons:: This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States