Before revision: We design a probabilistic algorithm that , given \epsilon>0 and a polynomial system F given by black-box evaluation functions, outputs an approximate zero of F, in the sense of Smale, with probability at least 1-\epsilon.
After revision: We design a probabilistic algorithm that , given \epsilon>0 and a polynomial system F given by black-box evaluation program. Secondly, we introduce a universal model of random polynomial systems with prescribed evaluation complexity L. Combining both, we show that we can compute an approximate zero of F, in the sense of Smale, with probability at least 1-\epsilon.