Skip to main content
SpringerLink
Log in

Recursiveness over the complex numbers is time-bounded

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 761))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Benedetti and J.J. Risler; Real algebraic and semialgebraic sets. Hermann (1990).

    Google Scholar 

  2. L. Blum, M. Shub and S. Smale; “On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines”. Bulletin of the Amer. Math. Soc., 21 (1989), pp.1–46.

    Google Scholar 

  3. F. Cucker and A. Torrecillas; “Two P-complete problems in the theory of the reals”. J. of Complexity, 8 (1992), pp.454–466.

    Google Scholar 

  4. F. Cucker, J. L. Montaña and L. M. Pardo; “Time Bounded Computations over the Reals”. Int. J. of Alg. and Comput., 2 (1992), pp.395–408.

    Google Scholar 

  5. F. Meyer auf der Heide; “On genuinely time bounded computations”. Symp. Theor. Aspects of Comp., LNCS 349, Springer Verlag, (1989), pp.1–16.

    Google Scholar 

  6. C. Michaux; “Une remarque à propos des machines sur R introduites par Blum, Shub et Smale”. C. R. Acad. Sci. Paris, t.309, Série I (1989), pp.435–437.

    Google Scholar 

  7. C. Michaux; “Machines sur les réels et problèmes NP-complets”, Séminaire de Structures Algébriques Ordonnées. Prépublications de l'équipe de logique mathématique de Paris 7, 1990.

    Google Scholar 

  8. M. Shub; “On the work of Stve Smale on the theory of computation”, in Proceedings of the Smalefest, (M. Hirsh, J. Marsden and M. Shub, Eds.), to appear.

    Google Scholar 

  9. S. Smale; “Some remarks on the foundation of numerical analysis”. SIAM Rev., 32 (1990), pp.211–220.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. d'Economia, Universitat Pompeu Fabra, C/ Balmes 132, 08008, Barcelona, Spain

    Felipe Cucker

  2. Dept. de Matemàtiques i Informàtica, Universitat de les Illes Balears, Cta. de Valldemossa, Km. 7.5, 07071, Palma de Mallorca, Spain

    Francesc Rosselló

Authors
  1. Felipe Cucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesc Rosselló
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudrapatna K. Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cucker, F., Rosselló, F. (1993). Recursiveness over the complex numbers is time-bounded. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-57529-4_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57529-0

  • Online ISBN: 978-3-540-48211-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation