Lectures related to Computable function

Introduces recursively defined functions, showcasing examples like the Fibonacci numbers.

Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.

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

Covers the computation and properties of the Hermite Normal Form (HNF) in matrix theory and lattice theory.

Covers the concept of graph sketching with a focus on connected components.

Covers the computation of loops in quantum field theory, focusing on dimensional regularization and Euclidean space.

Introduces recursively defined functions and demonstrates how to compute values and prove properties using mathematical induction.

Covers trust region methods, focusing on the framework and algorithms.