Lectures related to Turing Machines: Decidability and Recursion Theory

Explores chaos in quantum field theories, focusing on conformal symmetry, OPE coefficients, and random matrix universality.

Explores Alan Turing's pivotal role in decrypting Enigma messages and revolutionizing calculus with the Turing Machine.

Explores countability and undecidable problems in the theory of computation.

Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.