banner


I’m excited to announce I will serve as teaching assistant for CS 125 — Computability and Complexity — fall 2019.

I will post a link to Prof. Ling’s class pages here when they are ready

I have not set office hours yet. My office is E332 Innovation Hall. See my UVM directory listing for contact information or email me at clayton dot cafiero at (you know the rest).

Please feel free to email with questions!

Topics - Formal languages and expressiveness. Chomsky hierarchy. Finite automata. Turing completeness and Church’s Thesis. Decidability and tractability. Complexity classes and theory of NP completeness. Prerequisites: CS 064 or MATH 052. Co-requisite: CS 124.