|Theory of Computation: Honors
Introduces the abstract notions of machine computation for honors students. Includes finite automata, regular expressions, and formal languages, with emphasis on regular and context-free grammars. Explores what can and cannot be computed by considering various models of computation including Turing machines, recursive functions, and universal machines
|CSE150 or CSE215; AMS 210 or MAT 211; Computer Science Honors Program or Honors College or the WISE Honors program or University Scholar
Harry R. Lewis and Christos H. Papadimitriou, Elements of the theory of computation, Prentice Hall. (Second Edition, 1998).
|Major Topics Covered in Course
No large scale projects are required.