COVID-19 Update
The health and safety of our community is of the utmost importance to us at UMass Boston. We are closely monitoring the evolving COVID-19 (Coronavirus) situation. Due to concerns, UMass Boston is currently operating online only. Many answers about the campus's response to the coronavirus can be found in our special coronavirus web section.

In addition please subscribe to our classmembers list for continued updates on courses and more. If you have any inquiries please contact us at csinfo@umb.edu.

Click here for a message from the CS Chair, Marc Pomplun as of March 20, 2020.

HomeAcademicsCourses → CS620

Theory of Computation (3 credits)

Functions computable by programs. Recursive functions and Turing machines; simulation and diagonalization. Universality and unsolvable problems. Kleene's hierarchy and the recursion theorem. Gregorczyk's hierarchy and Ackermann's function. Abstract complexity. Formal languages and classes of automata. Inherently difficult combinatorial problems.

Pre-requisites

CS220/CS320L/MATH320L


This page was last modified on September 21, 2018
© 2018 University of Massachusetts Boston

Template by OS Templates