Computing over the Reals: Foundations for Scientific Computing

Mark Braverman, Stephen Cook

We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue that this is a good way to formalize many problems…