Computability of Julia sets

DOI10.1007/978-3-540-68547-0zbMath1314.37033arXivmath/0610340OpenAlexW2949846556MaRDI QIDQ932107

Michael Yampolsky, Mark Braverman

Publication date: 10 July 2008

Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0610340

Mathematics Subject Classification ID

Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05) Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Complexity of computation (including implicit computational complexity) (03D15) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Research exposition (monographs, survey articles) pertaining to dynamical systems and ergodic theory (37-02) Computation over the reals, computable analysis (03D78)

Related Items (17)

Computability Models: Algebraic, Topological and Geometric Algorithms ⋮ Computability of topological pressure on compact shift spaces beyond finite type* ⋮ A topological view on algebraic computation models ⋮ Computing the exact number of periodic orbits for planar flows ⋮ PAC learning, VC dimension, and the arithmetic hierarchy ⋮ Separating notions in effective topology ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Computability of the Julia set. Nonrecurrent critical orbits ⋮ Computability at zero temperature ⋮ On computational complexity of Cremer Julia sets ⋮ Fractal dimension versus process complexity ⋮ Lattice structures for attractors. II ⋮ Notes on computable analysis ⋮ Rigorous bounds for polynomial Julia sets ⋮ Almost every real quadratic polynomial has a poly-time computable Julia set ⋮ On the computability of rotation sets and their entropies ⋮ Constructing locally connected non-computable Julia sets

This page was built for publication: Computability of Julia sets