  The Arithmetic Fourier Transform is a numerical formulation for computing
Fourier series and Taylor series coefficients. It competes with the Fast
Fourier Transform in terms of speed and efficiency, requiring only addition
operations and can be performed by parallel processing. The AFT has some deep
connections with the Prime Number Theorem and its rich history is discussed in
this expository article.
