18.404J / 6.840J Theory of Computation, Fall 2006

18.404J / 6.840J Theory of Computation, Fall 2006

Show other versions (1)

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.

Bibliographic Details
Main Author: Sipser, Michael
Other Authors: Massachusetts Institute of Technology. Department of Mathematics
Format: Learning Object
Language:en-US
Published: 2021
Subjects:
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, and interactive proof systems
270303
Computational Mathematics
Online Access:https://hdl.handle.net/1721.1/137168

Internet

https://hdl.handle.net/1721.1/137168

Similar Items