CSE104: Computability and Computational Complexity
Turing machines, general phase-structure grammars, the Chomsky hierarchy, recursive functions, diagonalization, the Halting problem, computability and unsolvability, computational complexity, time and space bounds, NP-completeness with emphasis on reductions between problems from various areas.5 credits
| Year | Fall | Winter | Spring | Summer |
|---|---|---|---|---|
| 2023-24 |
|
|||
| 2020-21 |
|
While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.