Advertisement

δ-Uniformly decidable sets and turing machines

  • Adriana Popovici
  • Dan Popovici
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1684)

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.

Keywords

Turing Machine Minimum Polynomial Total Function Dense Subspace Input Tape 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BSS]
    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–46zbMATHMathSciNetCrossRefGoogle Scholar
  2. [BV]
    Boldi, P., Vigna, S.: δ-uniform BSS machines. J. Complexity 14 (1998) 234–256zbMATHCrossRefMathSciNetGoogle Scholar
  3. [Gaa]
    Gaal, S.A.: Point set topology. Pure and Applied Mathematics, Academic Press, Boston (1964)Google Scholar
  4. [Lan]
    Lang, S.: Algebra. Addison-Wesley (1971)Google Scholar
  5. [Tur]
    Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42 (1936) 230–265. A correction 43 544–546zbMATHCrossRefGoogle Scholar
  6. [Wae]
    van der Waerden, B.L.: Algebra. Springer-Verlag, Berlin, eighth edition (1971)zbMATHGoogle Scholar
  7. [Wei]
    Weihrauch, K.: Type 2 recursion theory. Theoret. Comput. Sci. 38 (1985) 17–33zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Adriana Popovici
    • 1
  • Dan Popovici
    • 2
  1. 1.Department of Computer ScienceWest University of TimişoaraTimişoaraRomania
  2. 2.Department of MathematicsWest University of TimişoaraTimişoaraRomania

Personalised recommendations