Non-computable Julia sets
From MaRDI portal
Recommendations
Cites work
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Computable functionals
- Filled Julia sets with empty interior are computable
- Frontiers in complex dynamics
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 54314 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1303206 (Why is no real title available?)
- scientific article; zbMATH DE number 1338133 (Why is no real title available?)
- scientific article; zbMATH DE number 739000 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 3183995 (Why is no real title available?)
- scientific article; zbMATH DE number 3110188 (Why is no real title available?)
- Iteration of analytic functions
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On computational complexity of Siegel Julia sets
- On the dynamics of polynomial-like mappings
- On the Julia set of a typical quadratic polynomial with a Siegel disk
- Parabolic Julia sets are polynomial time computable
- Siegel disks with smooth boundaries
- The Brjuno functions and their regularity properties
- The computational complexity of some Julia sets
- Variation of the conformal radius
Cited in
(62)- Constructing locally connected non-computable Julia sets
- On the computability of fractal dimensions and Hausdorff measure
- Positive reducibility of the interior of filled Julia sets
- Markov chains and generalized wavelet multiresolutions
- Computability in planar dynamical systems
- Non computable Mandelbrot-like sets for a one-parameter complex family
- Almost every real quadratic polynomial has a poly-time computable Julia set
- Computability, noncomputability, and hyperbolic systems
- Computability and Beltrami fields in Euclidean space
- Computability of limit sets for two-dimensional flows
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval
- Non-computable impressions of computable external rays of quadratic polynomials
- Statistical properties of dynamical systems -- Simulation and abstract computation
- Computational intractability of attractors in the real quadratic family
- Computability of the Julia set. Nonrecurrent critical orbits
- Real quadratic Julia sets can have arbitrarily high complexity
- Randomness, computation and mathematics
- Computability and dynamical systems
- Incomputability in physics and biology
- Poly-time computability of the Feigenbaum Julia set
- Non-autonomous Julia sets with escaping critical points
- Computing geometric Lorenz attractors with arbitrary precision
- Is the Mandelbrot set computable?
- An algorithmic approach to lattices and order in dynamics
- Towards understanding the theoretical challenges of numerical modeling of dynamical systems
- Conservatively approximable functions
- Constructing non-computable Julia sets
- Computability of Julia sets
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Not all Julia sets are quasi-self-similar
- scientific article; zbMATH DE number 2063224 (Why is no real title available?)
- Tight space-noise tradeoffs in computing the ergodic measure
- A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations
- Effective symbolic dynamics
- On the complexity of convex hulls of subsets of the two-dimensional plane
- Jordan curves with polynomial inverse moduli of continuity
- scientific article; zbMATH DE number 1405336 (Why is no real title available?)
- Computable Geometric Complex Analysis and Complex Dynamics
- Computability of topological pressure on compact shift spaces beyond finite type*
- Computing the exact number of periodic orbits for planar flows
- On computational complexity of Cremer Julia sets
- On the computability of rotation sets and their entropies
- Computational unsolvability of domains of attraction of nonlinear systems
- Probability, statistics and computation in dynamical systems
- Computability in Dynamical Systems
- Computability of Brolin-Lyubich measure
- Robust non-computability of dynamical systems and computability of robust dynamical systems
- Computation with real numbers and continuous-time dynamical systems
- Computability of countable subshifts in one dimension
- On computability of equilibrium states
- On the algorithmic descriptive complexity of attractors in topological dynamics
- Hydrodynamic and symbolic models of computation with advice
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
- Analysis of fractals, image compression, entropy encoding, Karhunen-Loève transforms
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
- On the complexity of computing the logarithm and square root functions on a complex domain
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
- Computability of Julia sets
- Dynamics of quadratic polynomials over local fields
- Filled Julia sets with empty interior are computable
- On computational complexity of Siegel Julia sets
- Jordan curves with polynomial inverse moduli of continuity
This page was built for publication: Non-computable Julia sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5469247)
