On computational complexity of Cremer Julia sets
From MaRDI portal
(Redirected from Publication:5146441)
Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Abstract: We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.
Recommendations
Cites work
- Computability of Julia sets
- Constructing locally connected non-computable Julia sets
- Dynamics in One Complex Variable. (AM-160)
- Filled Julia sets with empty interior are computable
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 739000 (Why is no real title available?)
- Non-computable Julia sets
Cited in
(6)- Almost every real quadratic polynomial has a poly-time computable Julia set
- Real quadratic Julia sets can have arbitrarily high complexity
- Computable Geometric Complex Analysis and Complex Dynamics
- Computability of Brolin-Lyubich measure
- On the complexity of spectra of bounded analytic functions
- Computability of Julia sets
This page was built for publication: On computational complexity of Cremer Julia sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146441)