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: 9
Average GPA: 3.41 (A-)
Strict A Rate (No A-) : 40.29%
Average Withdrawal Rate: 5.03%
| Lenwood S Heath | 2020 | 84.7% | 15.4% | 0.0% | 0.0% | 0.0% | 0.0% | 3.81 | 2 |
| Gregory W Kulczycki | 2006 | 53.8% | 46.2% | 0.0% | 0.0% | 0.0% | 0.0% | 3.52 | 1 |
| Layne T Watson | 2022 | 32.1% | 41.3% | 11.1% | 4.2% | 0.0% | 11.3% | 3.11 | 4 |
| Vicky Choi | 2011 | 55.0% | 40.0% | 5.0% | 0.0% | 0.0% | 0.0% | 3.55 | 2 |