Lectures related to Turing Machines: Recursive Languages

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

Theory of Computation: Decidability and Complexity

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.

Covers various topics in quantum chemistry, including color, draw tools, shapes, and mathematical equations.

Berni Alder Prize: Celebrating 50 Years of CECAM

Commemorates 50 years of CECAM and the Berni J. Alder CECAM Prize, covering milestones in computational methods, quantum mechanics, slip motion, and more.

Reformulating Problems: Tools and Intuition

Focuses on open problems and the importance of reformulating problems with better tools and intuition.

Theory of Computation: Undecidable Problems

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

Linear Algebra: Efficiency and Complexity

Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.