Elementary Algorithms and Their Implementations

  • Yiannis N. Moschovakis
  • Vasilis Paschalis

In the sequence of articles [3, 4, 5, 6, 7], Moschovakis has proposed a mathematical modeling of the notion of algorithm—a set-theoretic “definition” of algorithms, much like the “definition” of real numbers as Dedekind cuts on the rationals or that of random variables as measurable functions on a probability space. The aim is to provide a traditional foundation for the theory of algorithms, a development of it within axiomatic set theory in the same way as analysis and probability theory are rigorously developed within set theory on the basis of the set theoretic modeling of their basic notions. A characteristic feature of this approach is the adoption of a very abstract notion of algorithm that takes recursion as a primitive operation and is so wide as to admit “non-implementable” algorithms: implementations are special, restricted algorithms (which include the familiar models of computation, e.g., Turing and random access machines), and an algorithm is implementable if it is reducible to an implementation.


Function Variable Partial Function Partial Computation Transition Table Elementary Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. van Emde Boas. Machine models and simulations. In Jan van Leeuwen, editor, Hand-book of Theoretical Computer Science, Vol. A, Algorithms and Complexity, pages 1-66. Elsevier and MIT Press, 1994.Google Scholar
  2. 2.
    J. McCarthy. A basis for a mathematical theory of computation. In P. Braffort and D Herschberg, editors, Computer Programming and Formal Systems, pages 33-70. North-Holland, 1963.Google Scholar
  3. 3.
    Y. N. Moschovakis. Abstract recursion as a foundation of the theory of algorithms. In M. M. Richter et. al., editors, Computation and Proof Theory, Vol. 1104, pages 289-364. Springer-Verlag, Berlin, 1984. Lecture Notes in Mathematics.Google Scholar
  4. 4.
    Y. N. Moschovakis. The formal language of recursion. The Journal of Symbolic Logic, 54:1216-1252, 1989.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Y. N. Moschovakis. A mathematical modeling of pure, recursive algorithms. In A. R. Meyer and M. A. Taitslin, editors, Logic at Botik ’89, Vol. 363, pages 208-229. Springer-Verlag, Berlin, 1989. Lecture Notes in Computer Science.Google Scholar
  6. 6.
    Y. N. Moschovakis. On founding the theory of algorithms. In H. G. Dales and G. Oliveri, editors, Truth in Mathematics, pages 71-104. Clarendon Press, Oxford, 1998.Google Scholar
  7. 7.
    Y. N. Moschovakis. What is an algorithm? In B. Engquist and W. Schmid, editors, Math-ematics unlimited - 2001 and Beyond, pages 929-936. Springer, 2001.Google Scholar
  8. 8.
    V. Paschalis. Recursive algorithms and implementations, 2006. (M.Sc. Thesis, in Greek).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Yiannis N. Moschovakis
    • 1
  • Vasilis Paschalis
    • 2
  1. 1.Department of MathematicsUniversity of CaliforniaLos AngelesUSA
  2. 2.Graduate Program in Logic, Algorithms and ComputationUniversity of Athens, PanepistimioupolisAthensGreece

Personalised recommendations