On the relations between distributive computability and the BSS model

This paper presents an equivalence result between computability in the BSS model and in a suitable distributive category. It is proved that the class of functions Rm\u2192Rn (with n,m finite and R a commutative, ordered ring) computable in the BSS model, and the functions distributively computable over a natural distributive graph based on the operations of R coincide. Using this result, a new structural characterization, based on iteration, of the same functions is given