arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0610340math.DS

Computability of Julia sets

Mark Braverman, Michael Yampolsky

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑