The following pages link to Non-computable Julia sets (Q5469247):
Displaying 45 items.
- A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations (Q483298) (← links)
- Computability of Brolin-Lyubich measure (Q651408) (← links)
- Computability of countable subshifts in one dimension (Q693067) (← links)
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited (Q714846) (← links)
- Analysis of fractals, image compression, entropy encoding, Karhunen-Loève transforms (Q844260) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
- Dynamics of quadratic polynomials over local fields (Q933194) (← links)
- On computational complexity of Siegel Julia sets (Q984472) (← links)
- Jordan curves with polynomial inverse moduli of continuity (Q995570) (← links)
- Constructing locally connected non-computable Julia sets (Q1048108) (← links)
- Markov chains and generalized wavelet multiresolutions (Q1628483) (← links)
- Computability in planar dynamical systems (Q1761693) (← links)
- Non computable Mandelbrot-like sets for a one-parameter complex family (Q1784950) (← links)
- Almost every real quadratic polynomial has a poly-time computable Julia set (Q1785010) (← links)
- Computability, noncomputability, and hyperbolic systems (Q2018989) (← links)
- Computability and Beltrami fields in Euclidean space (Q2109116) (← links)
- Computability of limit sets for two-dimensional flows (Q2117814) (← links)
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval (Q2176543) (← links)
- Non-computable impressions of computable external rays of quadratic polynomials (Q2339170) (← links)
- Statistical properties of dynamical systems -- Simulation and abstract computation (Q2393223) (← links)
- Computational intractability of attractors in the real quadratic family (Q2417754) (← links)
- Computability of the Julia set. Nonrecurrent critical orbits (Q2438692) (← links)
- Randomness, Computation and Mathematics (Q2904405) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- Incomputability in Physics and Biology (Q2919943) (← links)
- Poly-time computability of the Feigenbaum Julia set (Q2976303) (← links)
- Computing geometric Lorenz attractors with arbitrary precision (Q3130791) (← links)
- An Algorithmic Approach to Lattices and Order in Dynamics (Q3176275) (← links)
- Towards understanding the theoretical challenges of numerical modeling of dynamical systems (Q3380363) (← links)
- Conservatively Approximable Functions (Q3455861) (← links)
- Computability, noncomputability and undecidability of maximal intervals of IVPs (Q3629381) (← links)
- Tight space-noise tradeoffs in computing the ergodic measure (Q4610200) (← links)
- Effective Symbolic Dynamics (Q4918032) (← links)
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
- Jordan Curves with Polynomial Inverse Moduli of Continuity (Q4921453) (← links)
- Computable Geometric Complex Analysis and Complex Dynamics (Q5024571) (← links)
- Computability of topological pressure on compact shift spaces beyond finite type* (Q5089481) (← links)
- Computing the exact number of periodic orbits for planar flows (Q5100021) (← links)
- On computational complexity of Cremer Julia sets (Q5146441) (← links)
- On the computability of rotation sets and their entropies (Q5207982) (← links)
- Computational unsolvability of domains of attraction of nonlinear systems (Q5322874) (← links)
- Probability, statistics and computation in dynamical systems (Q5740360) (← links)
- Robust non-computability of dynamical systems and computability of robust dynamical systems (Q6597950) (← links)
