Theory of Computation
Course #: CS 620
Description:
Functions computable by programs. Recursive functions and Turing machines; simulation and diagonalization. Universality and unsolvable problems. Kleene's hierarchy and the recursion theorem. Gregorczyk's hierarchy and Ackermann's function. Abstract complexity. Formal languages and classes of automata. Inherently difficult combinatorial problems.
Pre Requisites: Pre-requisite: CS 220
Offered in:
2024 Fall
| Section | Class Number | Schedule/Time | Instructor | Location | |
|---|---|---|---|---|---|
| 01 | 4578 | MW 4:00 - 5:15 pm |
Simovici,Dan | McCormack M02-0423 | |
|
Session:
Regular
Class Dates:
09/03/2024 - 12/13/2024
Capacity:
35
Enrolled:
24
Status:
Open
Credits:
3/3
Class Notes:
Pre Requisites:
Pre-requisite: CS 220
Course Attributes:
|
|||||