CSCI0510
(Formerly
CS051
)
Models of Computation
| Offered This Year? |
Yes
|
| When Offered? |
Every Year
|
Description
This course introduces basic models of computation including languages, finite-state automata and Turing machines. Proves fundamental limits on computation (incomputability, the halting problem). Provides the tools to compare the hardness of computational problems (reductions). Introduces computational complexity classes (P, NP, PSPACE and others). Prerequisite: CSC0220.
|
Page Owner: webmaster
|
Last Modified: Wed Sep 3 12:06:24 2008
|