Skip to main content

Theory of computation

Part of the Lecture Notes in Mathematics book series (LNM,volume 1525)

Abstract

It could be said that the modern theory of computation began with Alan Turing in the 1930's. After a period of steady development, work in complexity, specially that of Steve Cook and Richard Karp around 1970, gave a deeper tie of the Turing framework to the practice of the machine. I will discuss an expansion of the above to a theory of computation and complexity over the real numbers (joint work with L. Blum and M. Shub).

Keywords

  • Turing Machine
  • Fundamental Theorem
  • Braid Group
  • Computable Function
  • Polynomial System

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.

Fields Medal 1966 for his work in differential topology, where he proved the generalized Poincaré conjecture in dimension n≥5: Every closed n-dimensional manifold homotopy equivalent to the n-dimensional sphere is homeomorphic to it. He introduced the method of handle-bodies to solve this and related problems.

Transcribed from the videotape of the talk by Felipe Cucker, Francesc Rosselló and Álvaro Vinacua; revised by the author.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Aberth, Precise Numerical Analysis, Brown Publishers, Dubuque, Iowa, 1988.

    MATH  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, Bull. Amer. Math. Soc. (N.S.) 21 (1989), no. 1, 1–46.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. S. A. Cook, The complexity of theorem-proving procedures, Proceedings 3rd ACM STOC (1983), 80–86.

    Google Scholar 

  4. F. Cucker, The arithmetical hierarchy over the reals, to appear in J. Logic Comput.

    Google Scholar 

  5. H. Friedman and K. Ko, Computational complexity of real functions, Theoret. Comput. Sci. 20 (1986), 323–352.

    MathSciNet  MATH  Google Scholar 

  6. D. Fuchs, Cohomologies of the braid group mod 2, Functional Anal. Appl. 4 (1970), 143–151.

    CrossRef  Google Scholar 

  7. R. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. Miller and J. Thatcher (eds.), Plenum Press, New York, 1972, 85–104.

    CrossRef  Google Scholar 

  8. M. B. Pour-El and I. Richards, Computability and noncomputability in classical analysis, Trans. Amer. Math. Soc. 275 (1983), 539–560.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. M. Pour-El, Review of [2], to appear in J. Symbolic Logic.

    Google Scholar 

  10. J. Renegar, On the efficiency of Newton's method in approximating all the zeroes of a system of complex polynomials, Math. Oper. Res. 12 (1987), 121–148.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. M. Shub, Some remarks on Bézout's theorem and complexity theory, to appear in Proceedings of the Smalefest, M. Hirsch, J. Marsden and M. Shub (eds.).

    Google Scholar 

  12. S. Smale, On the topology of algorithms I, J. Complexity 3 (1987), 81–89.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. S. Smale, Some remarks on the foundations of numerical analysis, SIAM Rev. 32 (1990), no. 2, 211–220.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. V. Vasiliev, Cohomology of the braid group and the complexity of algorithms, to appear in Proceedings of the Smalefest, M. Hirsch, J. Marsden and M. Shub (eds.).

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1992 Springer-Verlag

About this paper

Cite this paper

Smale, S. (1992). Theory of computation. In: Casacuberta, C., Castellet, M. (eds) Mathematical Research Today and Tomorrow. Lecture Notes in Mathematics, vol 1525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0089205

Download citation

  • DOI: https://doi.org/10.1007/BFb0089205

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56011-1

  • Online ISBN: 978-3-540-47341-1

  • eBook Packages: Springer Book Archive