Building a model of a useful Turing machine

AbstractThe principal ideas of a universal computer are gradually introduced into a functional model of the Turing machine. The strict sequentiality of this model is confronted with parallelism observed in real computers.This paper follows up the presentation [1] and is complemented by [2,3]