| Credit Hours: | 3 |
| Course Coordinator: | |
| Course Description: | Computability theory: study of models of computation (Turing, Church, Kleene), recursive function theory, properties of recursive, and recursively innumerable sets. Prerequisite: CS 311. |
| Prerequisites: | |
| Goals: | |
| Textbooks: | |
| References: | |
| Major Topics: | |
| Laboratory Exercises: |
| CAC Category Credits | Core | Advanced |
| Data Structures | ||
| Algorithms | ||
| Software Design | ||
| Computer Architecture | ||
| Programming Languages |
| Oral and Written Communications: | |
| Social and Ethical Issues: | |
| Theoretical Content: | |
| Problem Analysis: | |
| Solution Design: |