• Publications
  • Influence
On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines
We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-completeExpand
  • 1,041
  • 60
  • PDF
A Simple Unpredictable Pseudo-Random Number Generator
Two closely-related pseudo-random sequence generators are presented: The ${1 / P}$generator, with input P a prime, outputs the quotient digits obtained on dividing 1 by P. The $x^2 \bmod N$generato... Expand
  • 950
  • 52
  • PDF
Global Stability of Dynamical Systems
1 Generalities.- 2 Filtrations.- 3 Sequences of Filtrations.- 4 Hyperbolic Sets.- 5 Stable Manifolds.- 6 Stable Manifolds for Hyperbolic Sets.- 7 More Consequences of Hyperbolicity.- 8 Stability.- 9Expand
  • 728
  • 47
  • PDF
Complexity of Bezout’s Theorem II Volumes and Probabilities
In this paper we study volume estimates in the space of systems of n homegeneous polynomial equations of fixed degrees d i with respect to a natural Hermitian structure on the space of such systemsExpand
  • 219
  • 28
Complexity of Bezout's Theorem: III. Condition Number and Packing
  • 234
  • 17
  • PDF
How many eigenvalues of a random matrix are real
Let A be an n x n matrix whose elements are independent random variables with standard normal distributions. As n oo , the expected number of real eigenvalues is asymptotic to V/7r . We obtain aExpand
  • 123
  • 17
  • PDF
Complexity of Bezout's theorem IV: probability of success; extensions
We estimate the probability that a given number of projective Newton steps applied to a linear homotopy of a system of n homogeneous polynomial equations in $n + 1$ complex variables of fixed degreesExpand
  • 160
  • 14
  • PDF