Now showing items 1-2 of 2
6.045J / 18.400J Automata, Computability, and Complexity, Spring 2005
This course is offered to undergraduates and introduces basic mathematical models of computation and the finite representation of infinite objects. The course is slower paced than 6.840J/18.404J. Topics covered include: ...
6.852J / 18.437J Distributed Algorithms, Fall 2005
This course intends to provide a rigorous introduction to the most important research results in the area of distributed algorithms, and prepare interested students to carry out independent research in distributed algorithms. ...