Lambda Calculus and Chill

10 minutes into lambda-calculus and chill... ℕ ≡ {0} ∪ {n | n = succⁿ(0)} ≡ {0, succ(0), succ(succ(0)), ..., succ(succ(... succ(0) ...))} n fois = {0, 1, 2, ..., n}

A math-heavy screenshot shows the natural numbers being defined recursively with the successor function. The joke is that “10 minutes into lambda-calculus and chill” has already become incomprehensibly technical, turning a casual phrase into an intimidating lesson in mathematical logic. EN: A math-heavy screenshot shows the natural numbers being defined recursively with the successor function. The joke is that “10 minutes into lambda-calculus and chill” has already become incomprehensibly technical, turning a casual phrase into an intimidating lesson in mathematical logic.

• @profunctor_io / 2503 2019-07-05