CS-5104: Computability and Formal Languages
Description: Formal theory of computability, the halting problem, models of computation, and Churchs thesis, and formal languages.
Pathways: N/A
Course Hours: 3 credits
Corequisites: N/A
Crosslist: N/A
Repeatability: N/A
Sections Taught: 3
Average GPA: 3.41 (rounds to B+)
Strict A Rate (No A-) : 46.44%
Average Withdrawal Rate: 15.08%
| Layne T Watson | 2022 | 31.0% | 29.8% | 8.3% | 8.3% | 0.0% | 22.6% | 3.13 | 2 |
| Lenwood S Heath | 2020 | 100.0% | 0.0% | 0.0% | 0.0% | 0.0% | 0.0% | 3.97 | 1 |