This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the Chomsky hierarchy, Turing machines and algorithmic universality, noncomputability and undecidability, tradeoffs between power and formal tractability.
| CRN | Course | Course Title | Term | Credits | Status | ||||
| 44978 | CSC 280 | COMPUTER MODELS & LIMITATIONS | Spring 2013 | 4.0 | Open | ||||
| Schedule: | Day | Begin | End | Building | Room | ||||
| MW | 1525 | 1640 | CSB | 601 | |||||
| Enrollment: | Sec Enroll | Sec Cap | Updated | ||||||
| 37 | 50 | 06/29/2012 | |||||||