On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines (1989)

by L Blum, M Shub, S Smale
Venue:Bulletin of the Amer. Math. Society