|
This article is cited in 19 scientific papers (total in 19 papers)
Computability of Julia sets
M. Sh. Braverman, M. Yampolsky Department of Mathematics, University of Toronto
Abstract:
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.
Key words and phrases:
Julia set, computability, complexity.
Received: January 12, 2007
Citation:
M. Sh. Braverman, M. Yampolsky, “Computability of Julia sets”, Mosc. Math. J., 8:2 (2008), 185–231
Linking options:
https://www.mathnet.ru/eng/mmj311 https://www.mathnet.ru/eng/mmj/v8/i2/p185
|
Statistics & downloads: |
Abstract page: | 435 | Full-text PDF : | 1 | References: | 71 |
|