Virtual University

Comparison of topologies (V-U)

NP-Completeness, Independent Sets (V-U)

Basis For a Topology (V-U)

Solution of Non Linear Equations (Bisection Method) (V-U)

TQBF (Cont.), FORMULA-GAME, Generalized Geography (V-U)

Composition of Continuous Functions (V-U)

Basis For a Topology: Examples (V-U)

Oracles, Turing Reducibility (V-U)

Solution of Non Linear Equations (Fixed Point Method) (V-U)

TQBF, Prove that TQBF is PSPACE-Complete (V-U)

Computation of Closure (V-U)

Overview of the course covered

Basis for Some Topologies (V-U)

Turing Machine and its Language (V-U)

Solution of Non Linear Equations (Newton Raphson Method) (V-U)

Connected component (V-U)

Post Correspondence Problem, Computable Functions (V-U)

Basis For Subspace (V-U)

Undicidability of the Halting Problem (V-U)

Solution of Non Linear Equations (Regula-Falsi Method) (V-U)

Connected component is closed (V-U)

Prove the Theorem: NL = co-NL (Cont.) (V-U)

Basis for Usual Topology R^n (V-U)

Variants of Turing Machines (V-U)

Solution of Non Linear Equations (Secant Method) (V-U)