Dec 10, 2025  
2025-2026 Graduate Catalog 
    
2025-2026 Graduate Catalog
Add to Portfolio (opens a new window)

CIS 870 - Theory of Computability

Credits 3

Formal models for computability; universal programs; Church’s thesis; unsolvable problems and reducibilities; partial recursive functions; recursive and recursively enumerable sets; s-m-n theorem and the recursion theorem.

Repeat for Credit
Y

Requisites
Prerequisite: CIS 770.

Typically Offered
Other



Add to Portfolio (opens a new window)