Lecture

Right Arrow

SEARCH COURSES / LECTURES

Left Arrow

Theory of Computation (V-U)

(45 Lectures Available)

S# Lecture Course Institute Instructor Discipline
1
  • A definition of Information, Incompressible Strings (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
2
  • An Approximation Algorithm for TSP Problem (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
3
  • Big Oh and Little Oh Notations, Time Complexity (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
4
  • Computable Functions (Cont.), Reducibility (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
5
  • Decidable Languages, The Acceptance Problem for DFAs (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
6
  • Designing Turing Machines (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
7
  • Enumerators, Dovetailing, The Church-Turing Thesis, Hilbert's Tenth Problem (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
8
  • Generalized Geography (Cont.) (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
9
  • Hamiltonian Path Problem (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
10
  • Incompressible Strings (Cont.), Complexity Theory (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
11
  • Independent Sets (Cont.), NP-Completeness (Cont.), Clique, Vertex Cover (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
12
  • Introduction (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
13
  • Linear Bounded Automata, Computation Histories, Context Free Grammars (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
14
  • Logical Theories (Cont.) (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
15
  • Logical Theories (Cont.), Godel's Theorem (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
16
  • LOGSPACE Transducer (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
17
  • Non-Deterministic Time, The Class P, The Class NP (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
18
  • NP-Completeness (Cont.) (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
19
  • NP-Completeness, Independent Sets (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
20
  • Oracles, Turing Reducibility (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
21
  • Overview of the course covered
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
22
  • Post Correspondence Problem, Computable Functions (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
23
  • Prove the Theorem: NL = co-NL (Cont.) (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
24
  • Prove the Theorem: NL = co-NL (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences
25
  • Recursion Theorem (Cont.), Logical Theories (V-U)
Theory of Computation (V-U) Virtual University Dr. Sarmad Abbasi Applied Sciences