Theory of Computation: Undecidable Problems

Related lectures (22)

Page 2 of 3

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

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

Explores the theory of computation, emphasizing problems definition, counting, and the limits of algorithmic computation.

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.

Covers counting distinct elements using hash functions and the median trick.

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.