Computability of Julia sets
| dc.creator | Braverman, Mark | |
| dc.creator | Yampolsky, Michael | |
| dc.date | 2006-10-10 | |
| dc.date | 2007-09-29 | |
| dc.date.accessioned | 2026-07-07T08:32:43Z | |
| dc.date.available | 2026-07-07T08:32:43Z | |
| dc.description | In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable. | |
| dc.description | Revised. To appear in Moscow Math. Journal | |
| dc.identifier | https://arxiv.org/abs/math/0610340 | |
| dc.identifier | http://arxiv.org/abs/math/0610340 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/138883 | |
| dc.subject | Dynamical Systems | |
| dc.subject | 37F50 | |
| dc.title | Computability of Julia sets | |
| dc.type | text |