scientific article
From MaRDI portal
Publication:3600690
zbMath1161.37035MaRDI QIDQ3600690
Mark Braverman, Michael Yampolsky
Publication date: 5 February 2009
Full work available at URL: http://www.ams.org/distribution/mmj/vol8-2-2008/abst8-2-2008.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (19)
A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes ⋮ Randomness, Computation and Mathematics ⋮ Statistical properties of dynamical systems -- Simulation and abstract computation ⋮ Real quadratic Julia sets can have arbitrarily high complexity ⋮ Computability in harmonic analysis ⋮ Computational intractability of attractors in the real quadratic family ⋮ Unnamed Item ⋮ On the complexity of computing the Hausdorff distance ⋮ Computability of Brolin-Lyubich measure ⋮ Probability, statistics and computation in dynamical systems ⋮ Curves that must be retraced ⋮ Non computable Mandelbrot-like sets for a one-parameter complex family ⋮ Unnamed Item ⋮ On the computability of rotation sets and their entropies ⋮ Towards understanding the theoretical challenges of numerical modeling of dynamical systems ⋮ On the computability of the set of automorphisms of the unit square ⋮ Constructing locally connected non-computable Julia sets ⋮ Non-computable impressions of computable external rays of quadratic polynomials ⋮ Computable Geometric Complex Analysis and Complex Dynamics
This page was built for publication:
