| n | f(n) |
|---|
Charles Babbage designed this machine to compute polynomial tables using the method of finite differences.
Any polynomial can be evaluated by repeated addition alone. For a degree-d polynomial, the d-th differences are constant.
Example: f(n) = n² has first differences 1,3,5,7... and constant second difference 2. The engine cascades additions through columns.