A critical review of the notion of algorithm in computer science

ABSTRACT

We first review the development of the notion of the algorithm as a fundamental paradigm of mathematics. We then suggest a definition of computer science that distinguishes it from all other sciences and from mathematics. Finally we argue that the conceptual concerns of computer science are quite different from the conceptual concerns of mathematics and that the notion of the algorithm is and has been an inappropriate and ineffective paradigm for computer science.

REFERENCES

• 1: Czeslaw Lejewski, "History of Logic," in Encyclopedia Britannica Macropaedia Vol. 11 (Chicago, William Benton, 1974)pp.56-72.
• 2: M. M. Garland, Cambridge Before Darwin (Cambridge, Cambridge University, 1980) p. 36.
• 3: Henry George Forder, Frederick Albert Valentine, "Euclidian Geometry," in Encyclopaedia Britannica Macropedia Vol. 7..(Chicago, William Benton, 1974) pp. 1099-1112.
• 4: Andrew Hodges, Alan Turing, Simon & Schuster Trade, 1984
• 5: David Hilbert, "Mathematical Problems," in Mathematics People Problems Results, ed. by Douglas M. Campbell and John C. Higgins (Belmont, Cal., Wadsworth International, 1984) p. 277.
• 6: A.A. Markov, Theory of Algorithms (Jerusalem, Keter Press, 1971) translated by Schorr-Kon. p. 1.
• 7: J. Wegstein, Algorithms: rootfinder, Communications of the ACM, v.3 n.2, p.74, Feb. 1960 [doi>10.1145/366959.366965]
• 8: Donald E. Knuth, Fundamental Algorithms (Reading, Mass., Addison-Wesley, 1969) p. I.
• 9: Zenon W. Pylyshyn, "Theoretical Ideas: Algorithms Automata and Cybernetics," in Perspectives on the Computer Revolution, ed. by Zenon W. Pylyshyn (Englewood Cliffs, N. J., Prentice-Hall, 1970) pp. 60- 68.
• 10: S. Amarel, "Computer Science," in Encyclopedia of Computer Science (lst ed. 1976),(New York, Petrocelli/Carter, 1976) pp. 314-318.
• 11: M.S. Carberry, H.M. Khalil, J.F. Leathnlm and L.S. Levy, Foundations of Computer Science (Potomac, MA, Computer Science Press, 1979) pp.2-4.
• 12: J.M. Brady, The Theory of Computer Science (London, Chapman and Hall 1977) pp.8-9.
• 13: Anthony Ralston, Introduction to Programming and Computer Science, Krieger Publishing Co., Inc., Melbourne, FL, 1978
• 14: I. Pohl, A. Shaw, The Nature of Computation (RockviUe, MA, Computer Science Press, 1981) pp. 3-7.
• 15: Paul Ceruzzi, Electronics Technology and Computer Science, 1940-1975: A Coevolution, IEEE Annals of the History of Computing, v.10 n.4, p.257-275, October 1988 [doi>10.1109/MAHC.1988.10036]
• 17: R.R. Korfhage, "Algorithm," in Encyclopedia of Computer Science (lst ed. 1976),(New York, Petrocelli/Carter, 1976) p. 49.
• 18: Ellis Horowitz , Sartaj Sahni, Fundamentals of Computer Alori, W. H. Freeman & Co., New York, NY, 1978
• 19: Benjamin W. Wall, C. V. Ramamoorthy "Theory of Algorithms and Computation Complexity with Applications to Software Design," in Handbook of Software Engineering, ed. by Charles R. Vick and C. V. Ramamoorthy (New York, Van Nostrand Reinhold, 1984) p. 88.
• 20: Kurt Maly, Allen R. Hanson, Fundamentals of the Computing Sciences (Englewood Cliffs, N.J., Prentice-Hall 1978) p. 41.
• 21: Frank S. Beckman, Mathematical Foundations of Programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1980
• 22: E V. Krishnamurthy, Introductory theory of computer science, Springer-Verlag New York, Inc., New York, NY, 1985
• 23: John K. Rice, John R. Rice, Introduction to Computer Science (New York, Holt, Rinehart and Winston, 1969) p. 47.
• 24: Juris Hartmanis, "Obervations About the Development of Theoretical Computer Science", Annals of the History of Computing, Vol. 3, No. 1, January 1981, p. 50.

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.2 HISTORY OF COMPUTING
      Subjects: Theory

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES

  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS

General Terms:
Algorithms, Design, Theory