On computational complexity of Cremer Julia sets

Artem Dudko; Michael Yampolsky

doi:10.4064/fm829-12-2019

Publishing house / Journals and Serials / Fundamenta Mathematicae / Online First articles

PDF files of articles are only available for institutions which have paid for the online version upon signing an Institutional User License.

On computational complexity of Cremer Julia sets

Volume 252 / 2021

Artem Dudko, Michael Yampolsky Fundamenta Mathematicae 252 (2021), 343-353 MSC: Primary 37F50; Secondary 68Q17. DOI: 10.4064/fm829-12-2019 Published online: 15 April 2020

Abstract

We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.

Authors

Artem DudkoInstitute of Mathematics
Polish Academy of Sciences
Śniadeckich 8
00-656 Warszawa, Poland
e-mail
Michael YampolskyDepartment of Mathematics
University of Toronto
40 St. George Street
Toronto, ON, Canada M5S 2E4
e-mail

8.00

Download

Search for IMPAN publications

Publishing house / Journals and Serials / Fundamenta Mathematicae / Online First articles

Fundamenta Mathematicae

On computational complexity of Cremer Julia sets

Volume 252 / 2021

Abstract

Authors

Search for IMPAN publications

Rewrite code from the image