On computational complexity of Cremer Julia sets

2019/07/25 by Dudko, Artem, Yampolsky, Michael · 1 citation
#Dynamical Systems (math.DS) #FOS: Mathematics

paper · doi:10.48550/arxiv.1907.11047

Abstract

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

Cited by

• Computable thermodynamic formalism

Related

• Real quadratic Julia sets can have arbitrarily high complexity
• Computability of Julia sets
• On computability of Julia sets: answers to questions of Milnor and Shub
• Non-computable Julia sets
• Non-accessible critical points of Cremer polynomials