Equality is a jump

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 49-64

  Boldi, Paolo ^a   Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348194897     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00283-7     Document Type: Article

References (14)

1. T. Becker, V. Weispfenning, Gröbner Bases, Graduate Texts in Mathematics, vol. 141, Springer, Berlin, 1993, in cooperation with Heinz Kredel.
2. L. Blum, M. Shub, S. Smale, 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.
3. P. Boldi, S. Vigna, δ-uniform BSS machines, J. Complexity 14 (1998) 234-256.
4. P. Boldi, S. Vigna, The Turing closure of an Archimedean field, Theoret. Comput. Sci., to appear.
5. K.-I. Ko, Reducibilities on real numbers, Theoret. Comput. Sci. 31 (1-2) (1984) 101-123.
6. K.-I. Ko, Complexity Theory of Real Functions, Progress in Theoretical Computer Science, Birkhäuser, Basel, 1991.
7. C. Kreitz, K. Weihrauch, Theory of representations, Theoret. Comput. Sci. 38 (1985) 35-53.
8. S. Lang, Algebra, Addison-Wesley, Reading, MA, 1971.
9. D. Marker, M. Messmer, Anand Pillay, Model Theory of Fields, of Lecture Notes in Logic, vol. 5, Springer, Berlin, 1996.
10. P. Odifreddi, Classical Recursion Theory, vol. 125, of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1989.
11. J.R. Shoenfield, Degrees of Unsolvability, North-Holland, Amsterdam, 1971.
12. R.I. Soare, Recursion theory and Dedekind cuts, Trans. Amer. Math. Soc. 140 (1969) 271-294,
13. B.L. van der Waerden, Algebra, 8th ed., Springer, Berlin, 1971.
14. K. Weihrauch, Type 2 Recursion Theory, Theoret. Comput. Sci. 38 (1) (1985) 17-33.