Does P≠NP over ℝ imply P≠NP ?


where ℝ is for Real number algorithms as described by Smale with a suitable formulation of P≠NP over ℝ. 


Complexity Theory and Numerical Analysis, Steve Smale, 2000
<http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.33.4678&rep=rep1&type=pdf> 



 Does P≠NP over ℝ imply P≠NP ?
Some years ago I read the paper "Computing over the Reals, Where Turing Meets Newton" by Lenore Blum, in which this question and related questions ("transfer results") are addressed: <http://www.ams.org/notices/200409/fea-blum.pdf>


