Non-computable Julia sets

DOI10.1090/S0894-0347-05-00516-3zbMath1099.37042OpenAlexW1809268447WikidataQ122998317 ScholiaQ122998317MaRDI QIDQ5469247

Michael Yampolsky, Mark Braverman

Publication date: 17 May 2006

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0894-0347-05-00516-3

zbMATH Keywords

Julia set polynomial complex dynamics

Mathematics Subject Classification ID

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

Related Items

Markov chains and generalized wavelet multiresolutions, Randomness, Computation and Mathematics, An Algorithmic Approach to Lattices and Order in Dynamics, Analysis of fractals, image compression, entropy encoding, Karhunen-Loève transforms, Conservatively Approximable Functions, Computability and Dynamical Systems, Incomputability in Physics and Biology, Statistical properties of dynamical systems -- Simulation and abstract computation, 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 entropy: from general systems to transformations on Cantor sets and the interval, Computability of topological pressure on compact shift spaces beyond finite type*, Computing the exact number of periodic orbits for planar flows, Computational intractability of attractors in the real quadratic family, An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable, Tight space-noise tradeoffs in computing the ergodic measure, Computability of the Julia set. Nonrecurrent critical orbits, Poly-time computability of the Feigenbaum Julia set, Computability of Brolin-Lyubich measure, Dynamics of quadratic polynomials over local fields, A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations, On computational complexity of Cremer Julia sets, Effective Symbolic Dynamics, 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, Computability in planar dynamical systems, Probability, statistics and computation in dynamical systems, Computability, noncomputability, and hyperbolic systems, The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited, On computational complexity of Siegel Julia sets, Non computable Mandelbrot-like sets for a one-parameter complex family, Almost every real quadratic polynomial has a poly-time computable Julia set, Jordan curves with polynomial inverse moduli of continuity, On the computability of rotation sets and their entropies, Towards understanding the theoretical challenges of numerical modeling of dynamical systems, Computability, noncomputability and undecidability of maximal intervals of IVPs, Constructing locally connected non-computable Julia sets, Non-computable impressions of computable external rays of quadratic polynomials, Computing geometric Lorenz attractors with arbitrary precision, Computability and Beltrami fields in Euclidean space, Computable Geometric Complex Analysis and Complex Dynamics, Computability of limit sets for two-dimensional flows

Cites Work