An operator scheme for composition of Turing machines is
developed and applied to the computation of the recursive functions
over an arbitrary alphabet.
Computational scheme, equivalence, and Turing machine are
defined. Some computational schemes are examined and shown to
be equivalent to the computational scheme of a Turing machine.