CS 763 - Computability and formal Languages

(3 units)

Turing machines, recursive functions, computability and undecidability. Formal languages and their decision problems.

Grading Basis: Graded
Units of Lecture: 3
Offered: Every Spring - Odd Years

Student Learning Outcomes
Upon completion of this course, students will be able to:
1. apply engineering and computer science research and theory to advance the art, science, and practice of the discipline.
2. design and conduct experiments as well as to analyze, interpret, apply, and disseminate the data.
3. understand research methodology.

Click here for course scheduling information. | Check course textbook information