Computable Geometric Complex Analysis and Complex Dynamics
From MaRDI portal
Publication:5024571
DOI10.1007/978-3-030-59234-9_5OpenAlexW2605524571MaRDI QIDQ5024571
Cristobal Rojas, Michael Yampolsky
Publication date: 26 January 2022
Published in: Theory and Applications of Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06459
Related Items (1)
Cites Work
- Computable Carathéodory theory
- The maximum-entropy measure of a rational endomorphism of the Riemann sphere
- Dynamics and abstract computability: computing invariant measures
- Computability of Brolin-Lyubich measure
- An effective Carathéodory theorem
- The Brjuno function continuously estimates the size of quadratic Siegel disks
- Filled Julia sets with empty interior are computable
- On the computational complexity of the Riemann mapping
- Equidistribution speed for endomorphisms of projective spaces
- On computational complexity of Siegel Julia sets
- Constructing locally connected non-computable Julia sets
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
- An effective Riemann Mapping Theorem
- The Brjuno functions and their regularity properties
- Non computable Mandelbrot-like sets for a one-parameter complex family
- Almost every real quadratic polynomial has a poly-time computable Julia set
- Non-computable impressions of computable external rays of quadratic polynomials
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Invariant sets under iteration of rational functions
- A constructive Riemann mapping theorem
- Iteration of analytic functions
- Real quadratic Julia sets can have arbitrarily high complexity
- Computing boundary extensions of conformal maps
- Poly-time computability of the Feigenbaum Julia set
- Is the Mandelbrot set computable?
- Computable functionals
- Numerische Realisierung konformer Abbildungen durch „Interpolation”
- Derandomization of Euclidean Random Walks
- Julia Sets are Uniformly Perfect
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
- On computational complexity of Cremer Julia sets
- Convergence of a Variant of the Zipper Algorithm for Conformal Mapping
- Non-computable Julia sets
- Parabolic Julia sets are polynomial time computable
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computable Geometric Complex Analysis and Complex Dynamics
