The computational complexity of some julia sets

DOI10.1145/780542.780570zbMath1192.68375OpenAlexW2081421381MaRDI QIDQ3581268

Weihrauch, Klaus, Robert Rettinger

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780570

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) Fractals (28A80)

Related Items

Is the Mandelbrot set computable?, Computability and Dynamical Systems, Computing the topological entropy of shifts, On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain, Computational unsolvability of domains of attraction of nonlinear systems, On the complexity of computing the logarithm and square root functions on a complex domain, Computability of topological pressure on compact shift spaces beyond finite type*, Computing eigenvalues of the Laplacian on rough domains, Dimensions of Points in Self-similar Fractals, Computable symbolic dynamics, On the computational complexity of the Riemann mapping, Rigorous bounds for polynomial Julia sets, Effective Symbolic Dynamics, Complexity of Operators on Compact Sets, On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane, Computability of countable subshifts in one dimension, Jordan Curves with Polynomial Inverse Moduli of Continuity, Definability as hypercomputational effect, On computational complexity of Siegel Julia sets, Jordan curves with polynomial inverse moduli of continuity, On the computability of rotation sets and their entropies, Non-computable Julia sets