  We define a generalization of the Turing machine that computes on general
sets. Our main theorem states that the class of generalized Turing machine
computable functions and the class of Set Recursive functions coincide.
