Computability of Julia sets
动力系统
2007-09-30 v2
摘要
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.
引用
@article{arxiv.math/0610340,
title = {Computability of Julia sets},
author = {Mark Braverman and Michael Yampolsky},
journal= {arXiv preprint arXiv:math/0610340},
year = {2007}
}
备注
Revised. To appear in Moscow Math. Journal