Non-computable Julia sets
Authors:
- M. BravermanMBM. Braverman
- M. YampolskyMYM. Yampolsky
Open Access
- 22 December 2005
- journal article
- Published by American Mathematical Society (AMS) in Journal of the American Mathematical Society
- Vol. 19 (3) , 551-578
Abstract
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.Keywords
This publication has 18 references indexed in Scilit:
- Hyperbolic Julia Sets are Poly-Time ComputableElectronic Notes in Theoretical Computer Science, 2005
- Siegel disks with smooth boundariesActa Mathematica, 2004
- Chapter 19 Polynomial-time computability in analysis1998
- Complexity and Real Computation1998
- The Brjuno Functions and Their Regularity PropertiesCommunications in Mathematical Physics, 1997
- Does a Julia set depend continuously on the polynomial?1995
- Complexity Theory of Real Functions1991
- Constructive Analysis1985
- On the dynamics of polynomial-like mappingsAnnales Scientifiques de lʼÉcole Normale Supérieure, 1985
- Computable functionalsFundamenta Mathematicae, 1955