UMass Boston

An aerial view of the UMass Boston campus at night
Theory of Computation

Course Overview

Date / Time Location Credits Minimium Tuition*
9/3/24 - 12/13/24
MoWe 4p.m. – 5:15p.m.
Wheatley W02-0107 3 $2557 (guest students)
Date
9/3/24 - 12/13/24
Time
MoWe 4p.m. – 5:15p.m.
Location
Wheatley W02-0107
Credits
3
Min. Tuition*
$2557 (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.

Guest Students
Add to Cart
Current Students
Register Now

Course Details