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 R(l) --> R(m) (with l, m finite and R a commuta tive, ordered ring) computable in the BSS model and the functions dist ributively computable over a natural distributive graph based on the o perations of R coincide. Using this result, a new structural character ization, based on iteration, of the same functions is given.