Lectures related to Recursion (computer science)

Explores recursion, fixpoints, and procedures in depth, emphasizing understanding recursive functions.

Explores problem-solving strategies like recursion and divide and conquer methods, with examples such as the Towers of Hanoi.

Explores the concept of divide and conquer in recursive algorithms, exemplified by the Towers of Hanoi.

Presents methods for problem-solving, emphasizing 'Divide and Conquer', recursion, and dynamic programming.

Explores dynamic programming through binomial coefficients calculation, emphasizing efficiency and memoization in problem-solving.

Covers the methodology of development, recursion, and debugging in C++.

Introduces algorithms as problem-solving procedures, covering complexity, correctness, and implementation in various languages.

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

Explores designing algorithms with recursion and dynamic programming, covering concepts like the Towers of Hanoi and efficient solutions.

Explores lambda calculus, higher-order functions, and recursive function encoding.

Introduces recursion in algorithms, focusing on termination conditions and EPFL principles.

Explores recursive functions, including factorials and Fibonacci sequences, and their scope and namespaces.

Covers techniques for solving recurrences and introduces the Master Theorem.

Explores the Tower of Hanoi algorithm, recursion, and dynamic programming in solving problems efficiently.

Covers the recursive algorithm for calculating the sum of the first N integers.

Explores nested recursive definitions using environments and the lifting of binary functions to work on values.

Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.

Explores dynamic programming for efficient problem-solving, illustrated with binomial coefficients and Pascal's triangle.

Covers tail recursion, optimizing functions in Scala for iterative processes and providing examples like tail-recursive factorial.

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