Algorithms theory, 3 types of universal algorithmic models are considered according to this theory. First type: relates the concept of algorithm with classical mathematical concepts such as computation and numerical functions. The most advanced and studied model of this class is recursive functions that first shaped the concept of algorithm. The second kind: It is the association of the algorithm with a determinism machine that performs very simple operations at each discrete time. These models are structurally closest to computers. The basic theoretical model of this genre is Turing machines that were put forward in the 1930s (before electronic computers). Third type: Algorithmic models are word processors based on changing words in any alphabet.