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

Monad (functional programming)

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

Overlapping subproblems

Dynamic programming solves overlapping subproblems by storing results of subproblems to avoid redundant calculations

Functor

Functors map between categories preserving composition and identity

O(n log n) is the lower bound for comparison-based sorting

O(n log n) is the lower bound because each of n elements must be compared at least log n times to ensure all permutations are considered

Kolmogorov complexity

Kolmogorov complexity is uncomputable

subword tokenization solves: handles rare words by breaking into known pieces

Subword tokenization solves rare word handling by breaking into known pieces