50 citations · 60 across the 4 of their papers we have counts for
4 papers
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…
On the Complexity of Real Functions
Mark Braverman
We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function…
Filled Julia sets with empty interior are computable
I. Binder, M. Braverman, M. Yampolsky
We show that if a polynomial filled Julia set has empty interior, then it is computable.
Non-computable Julia sets
Mark Braverman, Michael Yampolsky
We show that under the definition of computability which is natural from the point of view of applications, there exist non-computable quadratic Julia sets.