In this lecture we shall fìrst reall the concept of MNA and compare it with that of turing machines. We shall then introduce the concept of generalized Markov algorithms (GMA), limiting our present exposition to the simplest type, called S–generalized Markov algorithms and we shall apply it to the defìnition of partial–recursive functions. Finally, we shall give some hints of other possible applications, as, for instance, the dcscription of a digital computer.
