Lectures related to Theory of Computation: Problems Definition and Counting (Denumerability)

Explores countability and undecidable problems in the theory of computation.

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

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

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

Explores counting infinite sets and decision problems, showcasing the limits of computation in solving certain undecidable problems.

Covers strings, countable sets, cardinality, and the concept of countability, exploring the countability of various sets and Cantor diagonalization.

Explores finite transition systems, propositional logic, truth interpretation, satisfiability, and boolean function representation with circuits.

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

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Introduces numbers and booleans in Python, covering numeric types, arithmetic operations, logical operations, and comparisons.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

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

Explores encoding finite systems with boolean functions, propositional logic, inductive invariants, and formal proof systems.

Explores countable and uncountable sets, demonstrating how to determine the cardinality of different sets through listing elements in a sequence.

Explores cardinality, countable sets, and examples of countable and uncountable sets.

Explores classic circuits in quantum computing, including Boolean functions and reversible gates.

Explores the Boolean Hidden Matching Problem, focusing on distinguishing messages with negligible probability.

Explores countable and uncountable sets, Cantor set, Mandelbrot set, and Box dimension in nonlinear dynamics and complex systems.

Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.

Explores optimization problems and greedy algorithms for efficient decision-making.