continuation-passing style (CPS) does: makes control flow explicit via callbacks

branch prediction does: guesses which way an if-statement will go to keep the pipeline full

Speculative execution: Predicts if-statement outcomes to keep the pipeline full

parametric polymorphism does: a function works for any type T without knowing what T is

Generics: A function template works for any type T without knowing T's specific type

Monad (functional programming)

Monads are a type constructor with two operations: return and bind

the Y combinator does: enables recursion in languages without named functions

The Y combinator allows anonymous functions to call themselves recursively

Vanishing gradient problem

Residual connections help by allowing gradient flow through the skip connection

Lambda calculus

Lambda calculus represents data using only functions