On Smale’s Work in the Theory of Computation: From Polynomial Zeros to Continuous Complexity

J. F. Traub

Chapter 31 in From Topology to Computation: Proceedings of the Smalefest, 1993, pp 317-320 from Springer

Abstract: Abstract I am delighted to have this opportunity to comment on the work of Steve Smale. Mike Shub was kind enough to give me an advance copy of his excellent paper (Shub [93]), which was very useful for it served as a reminder of the many areas in the theory of computation to which Steve has made major or often seminal contributions.

Keywords: Computational Complexity; Turing Machine; Digital Computer; Intrinsic Difficulty; Multivariate Integration (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2740-3_31

Ordering information: This item can be ordered from
http://www.springer.com/9781461227403

DOI: 10.1007/978-1-4612-2740-3_31

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().