 |
|
||||||||||||||||||
 |
 |
 |
 |
 |
 |
 |
 |
|
|||||||||||
|
|
||||||||||||||||||
|
|
||||||||||||||||||
|
|
||||||||||||||||||
CSE540
| Course | CSE540 |
| Title | Theory of Computation |
| Description | Models of computation: finite-state machines, stack machines, Turing machines, Church's thesis; Computability theory: halting problem and unsolvability, introductory recursion theory; Complexity theory: complexity measures, time and space hierarchy, NP-complete problems. |
| Prerequisite | CSE 303 |
| Credit Information | 3 - credits |
| Course Webpage | http://www.cs.sunysb.edu/~cse540 |
