Poly-time computability of the Feigenbaum Julia set-Reference-Cited by-同舟云学术

Poly-time computability of the Feigenbaum Julia set

Published:2015-07-21 Issue:8 Volume:36 Page:2441-2462
ISSN:0143-3857
Container-title:Ergodic Theory and Dynamical Systems
language:en
Short-container-title:Ergod. Th. Dynam. Sys.

Author:

DUDKO ARTEM,YAMPOLSKY MICHAEL

Abstract

We present the first example of a poly-time computable Julia set with a recurrent critical point: we prove that the Julia set of the Feigenbaum map is computable in polynomial time.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,General Mathematics

Reference20 articles.

1. A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions

2. Renormalization and 3-Manifolds Which Fiber over the Circle

3. Non-computable Julia sets

4. Feigenbaum-Coullet-Tresser Universality and Milnor's Hairiness Conjecture

5. [3] M. Braverman . Computational complexity of Euclidean sets: hyperbolic Julia sets are poly-time computable. Master’s Thesis, University of Toronto, 2004.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computability of topological pressure on compact shift spaces beyond finite type*;Nonlinearity;2022-06-29

2. Real Quadratic Julia Sets Can Have Arbitrarily High Complexity;Foundations of Computational Mathematics;2020-04-16

3. On the Lebesgue measure of the Feigenbaum Julia set;Inventiones mathematicae;2020-01-29

4. On the computability of rotation sets and their entropies;Ergodic Theory and Dynamical Systems;2018-08-10

5. Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set;Foundations of Computational Mathematics;2017-09-15