University of Virginia
CS 302 — Theory of Computation
34 documents • ranked by quality and engagement.
No description provided
Completeness in NP
Context-Free Languages Notes
Undecidable Problems of Significance
Preview of Final Exam
Pushdown Automata (Nondeterministic)
Languages Context-Free - Theory of Computation
Computability and Calculus
Genomes Computing and Computing Genomes - Theory of Computation
Thesis of Church and Turing - CS 302
Undecidability and Universality - CS 302
P vs NP Problem - CS 302
Contextual Context-Free Languages
Undecidability Problem Set Five
Complexity-Based Security
Automata Pushdown - Theory of Computation
Course Exam
Theory and Practice of Undecidability
Machines of Turing
Course Syllabus
Turing Machine Review
Complexity Problem Set Six
Pumping Lemma Notes
Second Examination
Complexity Classes Classy