Jan 28, 2025  
2009-2010 UMass Dartmouth Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home
  Accreditation
  Academic Calendar
  Introduction to the University
  Mission and Vision Statements
  Master List of Academic Programs
  Trustees, Officers, Administrators, and Faculty
  Colleges, Departments, and Programs
  Degrees and Other Programs Offered
  Search Courses by Department
  Search Courses by Prefix
  Admission to the University
  Special Admission Opportunities: College Now
  Expenses and Student Financial Services
  Academic Regulations and Procedures
  Special Learning Opportunities
  Advanced Learning Opportunities: Honors Program
  The Campus Experience: Services and Support
  Research, Outreach, and Service
  Professional and Continuing Education
  Key to the Listings of Courses and Programs
  Directions for Correspondence or Inquiries

  Campus Visits
  Leadership and Civic Engagement
HELP
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.