Stateless turing machines and fixed points

Thesnm function defined in the iteration theorem is shown to be quite subelementary through the use of stateless Turing machines. This means that recursion theorems can be used subrecursively with no change in computational complexity.