paper: Reword introductory paragraph

Author: dalcinl

docs/paper/paper.md

@@ -23,10 +23,13 @@ bibliography: paper.bib
 
 # Summary
 
-The fast Fourier transform (FFT) is an algorithm that efficiently computes the
-discrete Fourier transform. The FFT is one of the most important algorithms
-utilized throughout science and society and it has been named *the most
-important numerical algorith of our time* by Prof Gilbert Strang [@strang94].
+The fast Fourier transform (FFT) is an algorithm that efficiently
+computes the discrete Fourier transform. The FFT is an ubiquitous
+algorithm utilized throughout science and engineering. Since the dawn
+of our digital society, the FFT permeated to the heart of everyday
+life applications involving audio, image, and video processing.  The
+FFT has been named *the most important numerical algorithm of our
+time* by Prof Gilbert Strang [@strang94].
 
 ``mpi4py-fft`` (https://bitbucket.org/mpi4py/mpi4py-fft) is an open-source
 Python package for computing (in parallel) FFTs of possibly very large and