What is it?
Whether an algorithm keeps rounding errors under control. Two mathematically equal formulas can behave very differently: subtracting nearly equal numbers (catastrophic cancellation) or iterating an unstable recurrence destroys accuracy.
Formulas
- the stable way to solve a quadratic
Where it shows up in computing
Catastrophic cancellation is the classic floating-point pitfall; stable reformulations avoid it.
Explicit integrators with too large a time step blow up; engines pick stable schemes and sub-step.
Where it shows up in AI
Libraries fuse softmax and cross-entropy (log-sum-exp) because the naive composition overflows.
Where is it used?
Computing topics reachable from here, through the chain of ideas that leads to them:
What depends on it
This page has the essentials. A fuller treatment (intuition, formal definition, worked example) is on the way.