Lectures related to Undecidability: Part 1

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Explores the existence of functions that cannot be computed, illustrated by famous paradoxes and the concept of undecidable problems.

Introduces recursion in algorithms, focusing on termination conditions and EPFL principles.

Introduces regular expressions, covering language sets, syntax, semantics, and limitations.