Introduction by Peter Henrici

Summary

Mathematics derives much of its vitality from the fact that it has several faces, each face having its own sharply distinguished features. One face, which might be called the dialectic face of mathematics, is the face of a scholar, or even of a philosopher. It is the face which tells us whether theorems are true or false, and whether mathematical objects with specified properties do or do not exist. Dialectic mathematics is an intellectual game, played according to rules about which there is a high degree of consensus, and where progress can be measured sharply in terms of the generality of a result that has been achieved.

There is another, entirely different face of mathematics, which I like to call its algorithmic face. This is the face of an engineer. The algorithmic mathematician tells us how to construct the beautiful things of whose existence we are assured by the dialectic mathematician. The rules of the game of algorithmic mathematics, and in particular the significance attached to results in algorithmic mathematics, depend on the equipment that is available to carry out the required constructions.

Dialectic mathematics has experienced a continuous growth at least since the time of C. F. Gauss. Algorithmic mathematics, on the other hand, has stagnated from Euler's time until very recently, because no really new computing equipment came into existence; even the manually operated desk calculator did not significantly increase the speed of computation. It has been brought to light by H. H. Goldstine that Gauss in essence invented the fast-Fourier-transform algorithm.