Now showing items 1-1 of 1

    • 18.404J / 6.840J Theory of Computation, Fall 2002 

      Sipser, Michael (2002-12)
      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, ...