(CS 320) Introduction to Computational Theory
An overview of the foundations of theoretical computer science, including finite state automata, regular expressions, context-free grammars, pushdown automata, Turing machines, computability, and undecidability.
| Credit Hours | 3.0 Lecture |
|---|---|
| Prerequisites | CS 206 |
| Offered | Variable |
| Programs | Computer Science (BS), Information Technology (BS) |
Course Learning Outcomes
Each student who passes this course will be able to do the following:
- Understand the limitations and capabilities of computer algorithms.
- Comprehend the significance of grammars (languages) in computer science and their applications.
- Gain insights into Church's Thesis, the Halting Problem, and other foundational theories in computer science.
• Enhance problem-solving skills by developing algorithms using finite automata, grammars, and Turing machines.