Mar 29, 2024  
2009-2010 UMass Dartmouth Undergraduate Catalog 
    
2009-2010 UMass Dartmouth Undergraduate Catalog [Archived Catalog]

CIS 521 - Computability Theory

3 credits
Prerequisites: 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.