ACM '73 Proceedings of the ACM annual conference
Toward a theoretical basis for estimating programming effort
ACM '75 Proceedings of the 1975 annual conference
Experimental validation of a structural property of fortran algorithms
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Invariant properties of algorithms.
Invariant properties of algorithms.
The internal structure of algorithms.
The internal structure of algorithms.
Natural laws controlling algorithm structure?
ACM SIGPLAN Notices
Impurities found in algorithm implementations
ACM SIGPLAN Notices
Language level, a missing concept in information theory
ACM SIGMETRICS Performance Evaluation Review
An experimental determination of the "purity" of a trivial algorithm
ACM SIGMETRICS Performance Evaluation Review
A recent approach to the study of algorithms
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
Analysis of algorithms implemented in software and hardware
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
| Hi-index | 0.00 |
Recent discoveries in the area of Algorithm Structure or Software Physics have produced a number of hypotheses. One of these relates the number of elementary mental discriminations required to implement an algorithm to measurable properties of that algorithm, and the results of one set of experiments confirming this relationship have been published. That publication, while significant, made no claim to finality, suggesting instead that further experiments were warranted. This paper will present the results of a second set of experiments, having the advantages of being conducted in a single implementation language, Fortran, from problem specifications readily available in computer textbooks. The first section of this paper presents the timing hypothesis, and the elementary equations upon which it rests. The second section presents the details of the experiment and the results which were obtained, and the third section contains an analysis of the data.