There were three major themes, centered on three different workshops:
Discovery and Experimentation in Number Theory, Complexity of Numerical
Computation and Computational Differential Geometry, Topology and
Dynamics.

In this conference we will mainly focus on the second theme, giving
account in particular on all the progress achieved on Smale's 17th
problem: "Can a zero of n complex polynomial equations in n
unknowns be found approximately, on the average, in polynomial time
with a uniform algorithm?"