Inverting the Laplace transform is a paradigm for exponentially ill-posed problems. For a class of operators, including the Laplace transform, we give forward and inverse formulae that have fast implementations using the fast Fourier transform. These formulae lead easily to regularized inverses whose effects on noise and filtered data can be precisely described. Our results give cogent reasons for the general sense of dread most mathematicians feel about inverting the Laplace transform.