Poly-time Computability of the Feigenbaum Julia set
classification
🧮 math.DS
keywords
juliacomputablefeigenbaumpoly-timecomputabilitycriticalexamplefirst
read the original abstract
We present the first example of a poly-time computable Julia set with a recurrent critical point: we prove that the Julia set of the Feigenbaum map is computable in polynomial time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.