|
Dec 22, 2024
|
|
|
|
Graduate School Course Catalog 2013-2015 [ARCHIVED CATALOG]
|
CISG 5115 - Theory of Computation (3) Prerequisites: CISG 5105 or equivalent undergraduate course. An advanced study of the theoretical models of computation, complexity, and computability. Topics include automata: finite, deterministic, nondeterministic, pushdown; languages: regular, context-free; grammars, Turing machines, halting problem, decidability, reducibility, intractability, complexity classes, time and space complexity and additional topics of instructor’s choice.
Click here for the Spring 2025 Class Schedule
|
|