most citedComputing over the Reals: Foundations for Scientific Computing

50 citations · 60 across the 4 of their papers we have counts for

collaborators
Showing math.DSShow all

2 papers · 1 filter

math.DS2004★ 3 cited

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.

math.DS2004★ 1 cited

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.