Lectures related to Theory of Computation: Monotone Complexity and XOR-SAT Lower Bounds

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

Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

Covers linear programming duality and complementary slackness condition.

Covers the problem statement of assembly, precision requirements, common couplings, stability, and spatial vectors.

Explores countability and undecidable problems in the theory of computation.

Covers state space models and the expressivity of transformers in sequence copying tasks.

Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.