# The link and equivalence between variant definition of computation model and computational complexity over reals

To unify the numerical computation and classic computability theory, or to pave a foundation for the numerical computation, mathematicians present variant computation model and computational complexity over reals, for example, the one in the book by Blum,Cucker,Shub, and Smale, or the one in Weihrauch's book Computable Analysis. mathematicians on such topics usually give the definition from their own view, and as far as I know, they usually do not compare their model with others. But we know, if they give a suitable model, eventually those variant model will be proven to be equivalent, as what had happened to the classic models.

So, first, let's give a list of computation model and computational complexity over reals.

Second, are they equivalents? Any proof for their equivalence?

Obviously, the suitable models have to include the classic computation models as special case, and possibly,the computational complexity have to be consistent with the classic ones. As a special case, computable numbers ,especially computable irrational algebraic and transcendental ones have to have uniform or consistent definition over classic model and the computational complexity.

In fact, the function $$x\mapsto e^x$$ is computable in the standard model, but not in the BCSS model as it is not "semi-algebraic" in a sense.
• Just to justify why it could be natural that exponentiation is computable classically but not in BCSS: BCSS does exact computations, while classical computability is about computable approximation. $e^x$ can certainly be approximated by BCSS machines, eg via the Taylor series. – Kevin Arlin Nov 12 '14 at 19:29