Algorithm dynamics
Maurice H. Halstead, Rudolf Bayer · 1973
A technique for measuring simple structural properties of algorithms is described. Using these measures, it is found that for a non-trivial class of algorithms there is a quantitative relationship between operators and operands and their usage. Properties of “Full” and “Reduced” algorithms are then explored, and shown to predict the quantitative relationship observed.