CMSC 452: Elementary Theory of Computation

SPRING 2014 HOMEPAGE

The Syllabus is in two parts:

Project 1 (READ THIS NOW- DUE TUESDAY FEB 25)

Project 2 (READ THIS NOW- DUE TUESDAY MAR 4)

Project to possibly get a BUMP from F-->D or D-->C

- ws1stalk.PDF, The talk on WS1S decidablility. (Still in progress.)
- closure.PDF,
- Primitive Recursive, Decidable, Undecidable, and Beyone,
- Blog about History of Savitch's Theorem
- Notes on Complexity Classes
- Notes on P, NP
- Peter Fontana's lectures: