The computational complexity of some Julia sets

DOI10.1145/780542.780570MaRDI QIDQ3581268zbMATH OpenOpenAlexFDO

Authors Robert Rettinger, Klaus Weihrauch

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

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

Recommendations

• The computational complexity of some Julia sets
• On computational complexity of Siegel Julia sets
• Almost every real quadratic polynomial has a poly-time computable Julia set
• Computability of the Julia set. Nonrecurrent critical orbits
• Computability of Julia sets

Cited in

(31)

• Efficient computations of Julia sets and their fractal dimension
• Almost every real quadratic polynomial has a poly-time computable Julia set
• Definability as hypercomputational effect
• Real quadratic Julia sets can have arbitrarily high complexity
• Computability and dynamical systems
• Poly-time computability of the Feigenbaum Julia set
• Is the Mandelbrot set computable?
• Backward iteration algorithms for Julia sets of Möbius semigroups
• Dimensions of Points in Self-similar Fractals
• Computable symbolic dynamics
• scientific article; zbMATH DE number 1210915 (Why is no real title available?)
• THE ACCURACY OF COMPUTER ALGORITHMS IN DYNAMICAL SYSTEMS
• scientific article; zbMATH DE number 1918624 (Why is no real title available?)
• The computational complexity of some Julia sets
• Effective symbolic dynamics
• Complexity of operators on compact sets
• On the complexity of convex hulls of subsets of the two-dimensional plane
• Jordan curves with polynomial inverse moduli of continuity
• Computability of topological pressure on compact shift spaces beyond finite type*
• On the computability of rotation sets and their entropies
• Rigorous bounds for polynomial Julia sets
• Computing the topological entropy of shifts
• Computational unsolvability of domains of attraction of nonlinear systems
• Non-computable Julia sets
• Computing eigenvalues of the Laplacian on rough domains
• Computability of countable subshifts in one dimension
• On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
• On the complexity of computing the logarithm and square root functions on a complex domain
• On the computational complexity of the Riemann mapping
• On computational complexity of Siegel Julia sets
• Jordan curves with polynomial inverse moduli of continuity

This page was built for publication: The computational complexity of some Julia sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581268)