The foundations of a theory of data processing

ABSTRACT

Until quite recently the only serious effort to develop a comprehensive theoretical formulation of the science of data processing, apart from purely linguistic considerations, has been the establishment of the theory of automata in the framework of mathematical logic. Although having undoubted intrinsic merit, this study has rarely, if ever, provided insights into the practical, day-to-day problem of applied data processing. This situation may not persist forever, but it is clear that, at present, a large gap exists between the abstract machine of theory and the real machine of the shop. Many specific problem areas, of course, have seen considerable analysis of a theoretical nature. Examples would include the sorting problem and the compiling problem. Certainly one major aspect of the subject, numerical computation, has been under intensive development since the time of Gauss. In none of these cases, however, has there been a serious search for unifying principles. In view of the current efforts to define programming languages which include the ability to prescribe complex processes, this absence of a coherent theory of such processes is deplorable.

INDEX TERMS

Primary Classification:
  J. Computer Applications
  J.1 ADMINISTRATIVE DATA PROCESSING

Additional Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic

General Terms:
Algorithms, Theory