Table of contents : Front matter On the Work of Steve Smale on the Theory of Computation The Work of Steve Smale on the Theory of Computation: 1990–1999 On Algorithms for Solving f(x) = 0 The Fundamental Theorem Of Algebra And Complexity Theory Computational Complexity: On the geometry of polynomials and a theory of cost: Part I On The Efficiency Of Algorithms Of Analysis Computational Complexity: On The Geometry Of Polynomials And A Theory Of Cost: Ii On the Existence of Generally Convergent Algorithms Newton's Method Estimates From Data At One Point On the Topology of Algorithms, I Algorithms for Solving Equations The Newtonian Contribution to Our Understanding of the Computer On A Theory Of Computation And Complexity Over The Real Numbers: Np-Completeness, Recursive Functions And Universal Machines Some Remarks On The Foundations Of Numerical Analysis Theory of Computation Complexity Of Bezout's Theorem. I: Geometric Aspects Complexity Of Bezout's Theorem Ii: Volumes And Probabilities Complexity of Bezout's Theorem: Iii. Condition Number and Packing Complexity Of Bezout's Theorem Iv: Probability Of Success; Extensions Complexity of Bezout's theorem V: Polynomial time The Gödel Incompleteness Theorem and Decidability over a Ring Separation of complexity classes in Koiran's weak model On The Intractability Of Hilbert's Nullstellensatz And An Algebraic Version Of “Np ≠ P?” Complexity And Real Computation: A Manifesto Algebraic Settings for the Problem “P ≠ Np?” Complexity theory and numerical analysis Some Lower Bounds for the Complexity of Continuation Methods A Polynomial Time Algorithm for Diophantine Equations in One Variable Complexity Estimates Depending on Condition and Round-off Error