 Markov (1954) provides a first precise definition of algorithm as a computational process that is determined, applicable, and effective. A computational process is determined if the instructions involved are precise enough not to allow for any “arbitrary choice” in their execution. The (human or artificial) computer must never be unsure about what step to carry out next. Algorithms are applicable for Markov in that they hold for classes of inputs (natural numbers for basic arithmetic operations) rather than for single inputs (specific natural numbers). Markov (1954:1) defines effectiveness as “the tendency of the algorithm to obtain a certain result”. In other words, an algorithm is effective in that it will eventually produce the answer to the computational problem.