Abstract
We give a characterization of the archimedean fields in which nontrivial δ-uniform decidable sets exist. More exactly, after we introduce a notion of Turing closure of an archimedean field we prove that such a field posseses nontrivial δ-uniformly decidable sets if and only if it is not Turing closed. Moreover, if a function is δ-uniformly computable on a Turing closed field then it is rational over each of the connected components induced on the halting set by the reals. Finally, given a field which is not Turing closed, we obtain as a consequence that there exists a δ-uniform machine computing a total function which is not rational.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. (N.S.) 21 (1989) 1–46
Boldi, P., Vigna, S.: δ-uniform BSS machines. J. Complexity 14 (1998) 234–256
Gaal, S.A.: Point set topology. Pure and Applied Mathematics, Academic Press, Boston (1964)
Lang, S.: Algebra. Addison-Wesley (1971)
Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42 (1936) 230–265. A correction 43 544–546
van der Waerden, B.L.: Algebra. Springer-Verlag, Berlin, eighth edition (1971)
Weihrauch, K.: Type 2 recursion theory. Theoret. Comput. Sci. 38 (1985) 17–33
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Popovici, A., Popovici, D. (1999). δ-Uniformly decidable sets and turing machines. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_36
Download citation
DOI: https://doi.org/10.1007/3-540-48321-7_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66412-3
Online ISBN: 978-3-540-48321-2
eBook Packages: Springer Book Archive