δ-Uniform BSS Machines

Journal of Complexity

Volumn 14, Issue 2, 1998, Pages 234-256

  Boldi, Paolo ^a   Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040757848     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1998.0475     Document Type: Article

References (19)

1. Blum L., Shub M., Smale S. On a theory of computation and complexity over real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. 21:1989;1-46.
2. Boldi P., Vigna S. The Turing closure of an archimedean field. Theoret. Comput. Sci. 1998.
3. Brattka, V.
4. Brattka V., Hertling P. Informatik Berichte. 1995.
5. Deil T. Informatik-Berichte. 1984.
6. Freund R. Real functions and numbers defined by Turing machines. Theoret. Comput. Sci. 23:1983;287-304.
7. Gaal S. A. Point Set Topology. Pure and Applied Mathematics. 1964;Academic Press, Boston.
8. Ker-I Ko. Reducibilities on real numbers. Theoret. Comput. Sci. 31:1984;101-123.
9. Ker-I Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. 1991;Birkhäuser, Basel.
10. Kreitz K., Weihrauch K. Theory of representations. Theoret. Comput. Sci. 38:1985;35-53.
11. Lang S. Algebra. 1971;Addison-Wesley, Reading.
12. Michaux, C.
13. Renegar J. On the computational complexity and geometry of the first-order theory of the reals, parts I, II and III. J. Symbolic Comput. 13:1992;255-352.
14. Rice H. G. Recursive real numbers. Proc. Amer. Math. Soc. 5:1954;784-791.
15. Shoenfeld J. R. Degrees of Unsolvability. 1971;North-Holland, Amsterdam.
16. Soare R. I. Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc. 140:1969;271-294.
17. van der Waerden B. L. Algebra. 1971;Springer, Berlin.
18. Weihrauch K. Type 2 recursion theory. Theoret. Comput. Sci. 38:1985;17-33.
19. qin two computing models: Blum-Shub-Smale machine and Turing machine.