UMass Boston

View of University Hall and Campus Center from the water.
Theory of Computation

Course Overview

Date / Time Location Credits Minimium Tuition*
9/2/25 - 12/12/25
MoWe 1p.m. – 2:15p.m.
Wheatley-Peters W01-0055 3 $2657 (guest students)
Date
9/2/25 - 12/12/25
Time
MoWe 1p.m. – 2:15p.m.
Location
Wheatley-Peters W01-0055
Credits
3
Min. Tuition*
$2657 (guest students)

Description

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.

Prerequisites

CS 220

Guest Students
Add to Cart
Current Students
Register Now

Course Details