1974 · 22 citations · 5 references
ComputingComputer ScienceAlgorithmsProgramming LanguagesTheory Of ComputationAlgorithm AnalysisAlgorithmic ComplexityComputational ComplexityRecursion TheoryStructural ComplexityAlgorithmic NotationComputational Complexity Of AlgorithmsExperimental ValidationOperatorsSyntax Analysis Complexity
Recent studies [1,3,8,9] have shown that theory predicts, and limited experimental data confirm, the existence of a functional relationship between the length, N, of the expression of an algorithm and the number of distinct operators, n1,and of distinct operands, n2,required to express that algorithm in various languages. Data previously examined, however, was restricted to a small sample of rather short, published algorithms, for which n1,n2and N could be measured manually.
5
Natural laws controlling algorithm structure?
M. H. Halstead · ACM SIGPLAN Notices · 1972 · 94 citations
Computing, Physics, Algorithms +5
Guy D. Morision, A. D. Peacock · Bee World · 1931 · 36 citations
Social Sciences, Political Communication, African Studies +2
M. H. Halstead, Rudolf Bayer · 1973 · 31 citations · Full text
Invariant properties of algorithms
Necdet Bulut, M. H. Halstead · ACM SIGPLAN Notices · 1973 · 20 citations · Full text