The following pages link to Computability of Julia sets (Q932107):
Displaying 17 items.
- Fractal dimension versus process complexity (Q504699) (← links)
- Lattice structures for attractors. II (Q515984) (← links)
- Notes on computable analysis (Q519888) (← links)
- Rigorous bounds for polynomial Julia sets (Q523958) (← links)
- PAC learning, VC dimension, and the arithmetic hierarchy (Q892140) (← links)
- Constructing locally connected non-computable Julia sets (Q1048108) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- Almost every real quadratic polynomial has a poly-time computable Julia set (Q1785010) (← links)
- Computability of the Julia set. Nonrecurrent critical orbits (Q2438692) (← 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)
- Computability at zero temperature (Q5136524) (← links)
- On computational complexity of Cremer Julia sets (Q5146441) (← links)
- On the computability of rotation sets and their entropies (Q5207982) (← links)
- Computability Models: Algebraic, Topological and Geometric Algorithms (Q5886546) (← links)
- Separating notions in effective topology (Q6142834) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)