Note
Computability of a map and decidability of its graph in the model of Blum, Shub and Smale

https://doi.org/10.1016/S0304-3975(97)00177-1Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, we show that in the theory of computation over a ring proposed by Blum, Shub and Smale in [1], the computability of a map is equivalent to the decidability of its graph if the ring is an algebraically closed field.

Cited by (0)