A model computer is designed and using this model computer it is demonstrated that computable functions are equivalent to recursive functions. It is also shown that iteratively defined computable functions can be transformed to recursively defined computable functions and that recursive programming is possible in principle, when iterative programming is possible.