Lectures related to Noncommutative Smith Form

Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.

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

Covers the computation of the picking factor and related exercises.