Lectures related to Computable number

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

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.

Discusses degrees of freedom analysis and solving methods in energy conversion flowsheets.

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

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

Covers the backpropagation algorithm for training neural networks and the representation of functions in multilayer networks.