  We show that the sum of a sequence of integers can be computed in linear time
on a Turing machine. In particular, the most obvious algorithm for this
problem, which appears to require quadratic time due to carry propagation,
actually runs in linear time by amortized analysis.
