The Time Hierarchy Theorem is a basic result in computational complexity, stating that Turing Machines that can run for longer time (i.e., $f(n)$) are able to decide more languages than Turing Machines that run in less time (i.e., $o(f(n)/\log n)$).
The Blum-Shub-Smale (BSS) algebraic model of computation is a uniform model of computation. Therefore, it is natural to ask if there is a similar time (or space) hierarchy theorem for this model. That is, showing that with more time, an algorithm in the BSS model can compute more than an algorithm that runs in less time in this model.
Is such an hierarchy result known?