Theory of Markov's Normal Algorithms

Abstract

This paper presents the concept of Normal Algorithms proposed by Andreii Andreevich Markov (A. A. Markov) in 1951. This concept is analogous to that of Turing machines introduced by Alan Mathaison Turing. A mathematical object of analysis is called computable if and only if it is Turing computable. One can also define computability in terms of normal algorithms.