# CS 243 / MATH 243 - Theory of Computation

0001 January 1

![banner]({{ site.url }}{{ site.baseurl }}/assets/pvsnp.jpg){:class=“img-responsive”}

During fall semester 2017, I will serve as teaching assistant for CS 243 / MATH 243 — Theory of Computation. This course is taught by Professor Alan Ling, and it meets Monday and Wednesday, from 5:05 PM to 6:20 PM, in Votey 209.

You can find Professor Ling’s page for this course here, and announcements here.

My office hours are Monday, 3:30 PM to 4:30 PM, in Votey 351A, or by appointment. I can be reached at clayton (dot) cafiero (at) (you know the rest).

Topics - reducibility and decidability, recursion theory, time and space complexity, P, NP, NP-completeness, PSPACE, PSPACE-completeness, L and NL, and other advanced topics in computability and complexity.