Lectures related to Computable set

Explores the convergence analysis of the Explicit Runge-Kutta scheme for accurate numerical solutions.

Explores recursively defined sets, natural numbers, strings, functions, and propositional logic formulae.

Introduces structural induction, a method to prove properties of elements in recursively defined sets.

Introduces structural induction, a method to prove properties of elements in recursively defined sets.

Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.

Covers the semester project on numerics, focusing on adaptive algorithms and multistep methods.

Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.