May 06, 2024  
2014-2015 UMass Dartmouth Graduate Catalog 
    
2014-2015 UMass Dartmouth Graduate Catalog [Archived Catalog]

CIS 521 - Computability Theory

Credits 3
Requirements: Prerequisite: CIS 361 or equivalent, or permission of instructor
Computability of sets and functions in terms of various computation models, Church-Turing thesis. Systems of recursion equations and Post canonical systems are studied. Properties of the classes of recursive functions, recursive sets, and recursively enumerable sets are also covered.