Linear algebra, calculus and optimization, and probability and statistics for graphics, machine learning, and data analysis, plus the discrete side: set theory, predicate logic, and formal methods.
Vectors and matrices show up constantly in computing โ a colour is three numbers, an image is a grid of them, a neural network's weights are a matrix, a 3D rotation is a matrix multiply โ because linear algebra is theโฆ
Differentiation and integration are usually taught as opposites โ one measures instantaneous rate of change, the other accumulates area under a curve. For computing purposes, differentiation is the one that mattersโฆ
Almost every piece of machine-learning and data-science content on this site leans on a small, recurring set of probability and statistics concepts โ this page collects them in one place, following DeGroot andโฆ
Every number a computer stores as a float is, in general, already an approximation โ Binary Representation and Computer Arithmetic covers why 0.1 has no exact binary representation at all. Interval arithmetic takes thatโฆ
A surprising amount of computer science is set theory wearing a domain-specific costume. A type is a set of values a variable is permitted to hold; a database table is a set of rows; a graph's edges are a set of pairsโฆ
Set Theory for Computing uses a predicate โ P(x), true or false depending on x โ informally, to describe a set by a rule rather than a listing. Predicate logic is what happens when that informal use is made precise: aโฆ
Predicate Logic closes by attaching a predicate to a specific point in a program โ "when execution reaches here, this must be true." A formal method is what results from taking that idea seriously as an engineeringโฆ