Dec 06, 2025  
2008-2009 Graduate Catalog 
    
Catalog Navigation
  Catalog Home
  About the Catalog
  About the University
  Calendar
  Glossary and Abbreviations
  Graduate School Admission
  Enrollment
  Tuition and Fees
  Degrees & Certificates Offered
  Grades
  All-University Regulations
  Auxiliary Services and Facilities
  Student Financial Assistance
  Services for Students
  Support Services
  Research Facilities and Centers
  International Programs
  Intercollegiate Athletics
  K-State Research and Extension
  Outreach
  University Faculty
  Colleges and Departments
  Degrees & Certificates Offered
  Courses
  Courses by Department
  Online Catalog Tutorial
  iSIS
  K-State Online
  WebMail
  My Portfolio
HELP
2008-2009 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
Pr.: CIS 770.


Add to Portfolio (opens a new window)