This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Nondeterminism, NFA Non regular language Chap 0 Chap 1.2 Chap 1.3 2 Chomsky Hierarchy and Complexity Hierarchy Turing Machine Chap 2 Chap 3 3 Decidability Decidable Languages, Halting Problem Chap 4 4 Reducibility and Undecidability Rice Theorem Post Correspondence Problem Chap 5 5 Reduction Continue: Turing Reduction, Mapping Reduction Polynomial Time reduction Chap 5.3, Handout Chap. 6.3 6 Recursion Theorem Chap 6.1 7 Decidability of Logical Theories: Goedel's Incomplete Theorem Chap 6.2 8 Kolmogorov Complexity Chap. 6.4 9 Time Complexity, Space Complexity, Determinism vs. Nondeterminism, P and NP Chap 7.17.3 10 NP Completeness and Cook's Theorem Chap. 7.4 11 Nondeterministic Space Complexity vs. Deterministic Space Complexity Savitch Theorem Inductive Counting Chap 8 12 Hierarchy Theorem and Relativization Chap 9.19.2 13 Probabilistic Algorithms Chap. 10.110.2 14 Interactive Proof Systems Chap. 10.310.4 15 Review...
View
Full Document
 Spring '04
 CHUNG
 Computer Science, Computational complexity theory, Computational Complexity, Nondeterminism, Review Read Chap

Click to edit the document details