The various definitions of the algorithm

   The various definitions of the algorithm in the explicit or implicit form contains a number of general requirements:

   Determinancy - certainty. Each time the next step of work is uniquely determined by the state of the system. Thus, the algorithm gives the same result (answer) for the same input data. In the modern interpretation of the different implementations of the same algorithm must be isomorphic graph. On the other hand, there are probabilistic algorithms, in which the next step of work is dependent on the current state of the system and the generated random numbers. However, when the method of generating random numbers in the list of "source data", probabilistic algorithm becomes a subset of normal.

   Transparency - an algorithm for the artist to include only those commands that he (the artist) is available, which includes in its system of command.

   Mass - the algorithm should be applicable to different sets of input data.

   Effectiveness - the completion of the algorithm results.

   The algorithm contains the error, if the results in incorrect results or no results at all.

   The algorithm is correct, if it gives correct results for any admissible input data.