Up: No Title
Previous: No Title
- Introduction
- 1 hour
- Sets
- 2 hours
- Relations and functions
- 3 hours
- Languages
- 2 hours
- Formal logic
- 3 hours
- Finite automata
- 5 hours
- Context-free languages
- 4 hours
- Turing machines
- 4 hours
- Uncomputability
- 3 hours
- Propositional calculus
- 3 hours
- Predicate calculus
- 3 hours
- Computational complexity
- 3 hours
Diane J. Cook
8/20/1997