✦ LIBER ✦

Braverman and Yampolsky: Computability of Julia Sets

✍ Scribed by Arnaud Chéritat

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructing Locally Connected Non-Compu

✍ Mark Braverman; Michael Yampolsky 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 350 KB

On Computational Complexity of Siegel Ju

✍ I. Binder; M. Braverman; M. Yampolsky 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 220 KB

Filled Julia Sets with Empty Interior Ar

✍ I. Binder; M. Braverman; M. Yampolsky 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 271 KB

Computability of Brolin-Lyubich Measure

✍ Ilia Binder; Mark Braverman; Cristobal Rojas; Michael Yampolsky 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 509 KB

Computability of Self-Similar Sets

✍ Hiroyasu Kamo; Kiko Kawamura 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 466 KB

The Computational Complexity of Some Jul

✍ Robert Rettinger; Klaus Weihrauch 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 251 KB