论文信息 - Natural laws controlling algorithm structure?

Natural laws controlling algorithm structure?

In this preliminary report, a hypothesis is developed to the effect that algorithms, considered as distrillations of thought, may possess a general structure which obeys physical laws. Testing the hypothesis against measurements of published algorithms does not disprove it.

M. H. Halstead | M. Halstead

[1] Saul Gorn. Algorithms: bisection routine , 1960, CACM.

[2] Dorothea S. Clarke. Algorithms: Bessel function I, asymptotic expansion , 1960, CACM.

[3] G. M. Galler. Algorithms: evaluation of the Chebyshev polynomial Tn(X) by recursion , 1960, CACM.

[4] R. J. Herbold. Algorithms: QuadI , 1960, CACM.

[5] Joseph Henry Wegstein. Algorithms: rootfinder , 1960, CACM.

[6] Charles F. Hockett,et al. A mathematical theory of communication , 1948, MOCO.

[7] M. Halstead. Machine-independent computer programming , 1962 .

[8] Robert Edward Noonan. Computer programming with a dynamic algebra , 1971 .

[9] A. Beam. Algorithms 13: complex exponential integral , 1960, CACM.

[10] Robert Claussen. Algorithms: Euclidean algorithm , 1960, CACM.

[11] Dorothea S. Clarke. Algorithms: Bessel function I, series expansion , 1960, CACM.

[12] Jean E. Sammet. Problems in, and a pragmatic approach to, programming language measurement , 1972, AFIPS '71 (Fall).

[13] A. A. Grau. Solution of polynomial equation by Bairstow-Hitchcock method , 1960, CACM.