Description
This course is intended as an introduction to the theory
of computation for senior level undergraduates and
graduate students looking for background material
in theory. The major topics within the course
include: models of computation, finite automata,
regular languages, context free grammars, Turing machines,
undecidability, infeasibility, diagonalizations, nondeterminism,
time and space, and complexity classes.
of computation for senior level undergraduates and
graduate students looking for background material
in theory. The major topics within the course
include: models of computation, finite automata,
regular languages, context free grammars, Turing machines,
undecidability, infeasibility, diagonalizations, nondeterminism,
time and space, and complexity classes.
General Information
CS Department Course Homepage
Name | Office Hours | |
---|---|---|
Aditi Kocherlakota | When? Where? | |
Omar M. Badr | When? Where? | |
Thomas Chang-Davidson | When? Where? | |
Athokshay Ashok | When? Where? | |
Conner Walsh | When? Where? | |
Yingjie Ling | When? Where? | |
Conor Gourley | When? Where? | |
Owen Morrissey | When? Where? | |
Ryan Dreher | When? Where? | |
Jinyong Hu | When? Where? | |
Yuchen Lu | When? Where? | |
Yuchen Yang | When? Where? | |
Derek | When? Where? | |
charles.oddleifson@tufts.edu | When? Where? | |
Tom Wexler | When? Where? |