4 citations · 21 across the 24 of their papers we have counts for
Showing 2004 · math.DSShow all
2 papers · 2 filters
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.