On founding the theory of algorithms
Yiannis N. Moschovakis · 1998
Abstract My topic is the problem of “founding” the theory of algorithms, part of the more general problem of “founding” computer science; whether it needs founding— which, I will argue, it does; what should count as a “foundation” for it; and why a specific “mathematical foundation” which I have proposed gives a satisfactory solution to the problem — better than the most commonly accepted “standard,, approach. It will be impossible to completely avoid making some comments about the general problem of “founding a mathematical discipline”, but I will strive (mostly) to stay away from overly broad generalities, and concentrate on the aspects of the question which are special to algorithms.