Formal sciences

Count sketch

Roundoff

Shift-and-invert

Directed graph

Graph theory

Forward checking

Compact operator

Borel sigma-algebra

Right-hand rule

Monotone operator

Roundoff error

Overflow and underflow

Spectral graph theory

Constraint satisfaction

Mixing time

Sparse graph

Bayesian regression

Randomness extractor

Queueing theory

Sequential rejection rule

Tolerance factor

Tolerance interval

Ties-to-even

Residual error

Proper scoring rules

MDL principle

Compression length

Cellular automaton

Conditional independence

ARCH

Hits@K

Quadratic distortion

Theory of Linear Arithmetic

Feasibility non-emptiness

Ambiguity set

Weight normalization

Robust likelihood

Undecidability

Completeness under Turing reducibility

Turing reduction

Recursively enumerable language

Rice’s theorem

Computability theory

Cantor’s diagonal argument

Numerical optimization

Forward–backward algorithm

Expectation–Maximization

Practical Identifiability

Pseudo-true parameter

Homogeneous solution