The Computational Complexity of Some Julia Sets

DOI10.1016/S1571-0661(04)80386-4zbMath1261.03168WikidataQ121592244 ScholiaQ121592244MaRDI QIDQ4916191

Weihrauch, Klaus, Robert Rettinger

Publication date: 19 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Computability at zero temperature

Cites Work

• Efficient computations of Julia sets and their fractal dimension
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
• Computational complexity of fractal sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Computational Complexity of Some Julia Sets