Dec 06, 2025  
2015-2016 Graduate Catalog 
    
2015-2016 Graduate Catalog [ARCHIVED 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.

Requisites:
Prerequisite: CIS 770.



Add to Portfolio (opens a new window)