Machine-independent computer programming
Machine-independent computer programming
A programming language
Empirical explorations of the logic theory machine: a case study in heuristic
IRE-AIEE-ACM '57 (Western) Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability
Hi-index | 0.00 |
A programmer in writing and checking out an arithmetic computer program provides both a procedural description of the program and a set of numeric test cases. Similarly, a student of elementary physics is often given a set of formulae to be used, and correct answers to problems. These two inputs in both cases provide a redundancy which gives some measure of confidence that the procedure is correct. In theory either is adequate, subject to the limitations of induction. While compilers operate upon the first type of data, several programs have been written which use the second type.