Filled Julia Sets with Empty Interior Are Computable

Abstract

We show that if a polynomial filled Julia set has empty interior, then it is computable.

Similar content being viewed by others

Some Recent Research Directions in the Computably Enumerable Sets

Chapter © 2017

Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings

Article 27 April 2016

Minimal Generalized Computable Numberings and Families of Positive Preorders

Article 01 July 2022

Author information

Authors and Affiliations

1. Mathematics Department, University of Toronto, Toronto, ON M5S 3G4, Canada

   I. Binder

2. Department of Computer Science, University of Toronto, Toronto, ON M5S 3G4, Canada

   M. Braverman & M. Yampolsky

Authors

1. I. Binder
   View author publications

   You can also search for this author in PubMed Google Scholar

2. M. Braverman
   View author publications

   You can also search for this author in PubMed Google Scholar

3. M. Yampolsky
   View author publications

   You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Binder, I., Braverman, M. & Yampolsky, M. Filled Julia Sets with Empty Interior Are Computable. Found Comput Math 7, 405–416 (2007). https://doi.org/10.1007/s10208-005-0210-1

Download citation

• Received: 14 November 2005

• Accepted: 26 June 2006

• Published: 28 December 2006

• Issue Date: November 2007

• DOI: https://doi.org/10.1007/s10208-005-0210-1

Keywords

• Periodic Orbit
• Periodic Point
• Fatou Component
• Siegel Disk
• Rotation Domain