Abstract
In On a theory of computation and complexity over the real numbers ..., Bull. Amer. Math. Soc. 21 (1989), 1-46, Blum, Shub, and Smale investigated computability over the reals and over ordered rings in general. They showed that over the reals, output sets of machines are recursively enumerable (i.e., halting sets of machines). It is asked in the aforementioned paper which ordered rings have this property (which we abbreviate $O = R.E.$). In Ordered rings over which output sets are recursively enumerable, Proc. Amer. Math. Soc. 112 (1991), 569-575, Michaux characterized the members of a certain class of ordered rings of infinite transcendence degree over $\mathbb {Q}$ satisfying $O = R.E.$ In this paper we characterize the subrings of $\mathbb {R}$ of finite transcendence degree over $\mathbb {Q}$ satisfying $O = R.E.$ as those rings recursive in the Dedekind cuts of members of a transcendence base. With Michauxâs result, this answers the question for subrings of $\mathbb {R}$ (i.e., archimedean rings).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.