Mar 29, 2024  
2009-2010 Graduate Catalog 
    
2009-2010 Graduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CIS 870 - Theory of Computability


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.

Credits: (3)

Requisites
Pr.: CIS 770.


KSIS Course Search




Add to Portfolio (opens a new window)