Lectures related to Course-of-values recursion

Problem Solving Strategies: General Overview

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

Dynamic Programming: Binomial Coefficients

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

Problem-solving Strategies 2: Recursion

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

Algorithm Design: Divide and Conquer

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

Recursive Algorithms: Divide and Conquer

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

Recursion: Understanding Recursive Functions

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

Understanding Chaos in Quantum Field Theories

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

The moving average filter

Covers the moving average filter and its transition to a first-order recursion.

Tower of Hanoi: Recursion and Dynamic Programming

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

Recursion: introduction

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

Greedy Strategy and Dynamic Programming

Explores the concepts of greedy strategy and dynamic programming in building optimal solutions for various problems.

Records and Variants

Introduces records, variants, evaluation rules, typing rules, aliasing challenges, and benefits in programming languages.

Von Neumann Extractor: Optimal Binary Extraction Procedure

Covers the von Neumann Extractor, rate computation, and extraction rates.

JVM Backend: Code Generation and Translation

Explores the translation of programs, definitions, and expressions into bytecode using the JVM backend.

Blocks and Lexical Scopes

Explores nested functions, blocks, visibility rules, and lexical scoping in Scala.

Safe Mutation in Scala

Explores safe mutation in Scala, emphasizing the management of mutable state and its significance in interactions, modeling, and implementation efficiency.

Functions in C++: Basics and Recursion

Covers the basics of functions in C++, including recursion and memory organization.

Tail Calls: Optimization Techniques

Explores tail call optimization in functional programming, discussing trampolines, Baker's technique, and more.

Designing Algorithms: Recursion and Dynamic Programming

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

Approximating Loops: Recursion

Explores approximating loops and defining recursive programs mathematically.