Poly-time computability of the Feigenbaum Julia set (Q2976303): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123349568, #quickstatements; #temporary_batch_1714629218081
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Geometry of the Feigenbaum map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of quadratic polynomials. I, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computer-assisted proof of the Feigenbaum conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-computable Julia sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points of composition operators. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parabolic Julia sets are polynomial time computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of the Julia set. Nonrecurrent critical orbits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filled Julia sets with empty interior are computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computational complexity of Siegel Julia sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renormalization and 3-Manifolds Which Fiber over the Circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feigenbaum-Coullet-Tresser universality and Milnor's hairiness conjecture / rank
 
Normal rank

Latest revision as of 17:40, 13 July 2024

scientific article
Language Label Description Also known as
English
Poly-time computability of the Feigenbaum Julia set
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references