CS-4124: Theory of Computation
Description: Theoretical analysis of the computational process; fundamental concepts such as abstract programs, classes of computational machines and their equivalence, recursive function theory, unsolvable problems, Churchs thesis, Kleenes theorem, program equivalence, and generability, acceptability, decidability will be covered.
Pathways: N/A
Course Hours: 3 credits
Corequisites: N/A
Crosslist: N/A
Repeatability: N/A
Sections Taught: 7
Average GPA: 2.53 (rounds to B-)
Strict A Rate (No A-) : 17.51%
Average Withdrawal Rate: 10.18%
| Layne T Watson | 2022 | 14.6% | 22.7% | 35.1% | 10.6% | 7.2% | 9.8% | 2.28 | 4 |
| Lenwood S Heath | 2024 | 33.5% | 28.2% | 18.5% | 4.6% | 4.6% | 10.7% | 2.87 | 3 |