Article contents
Poly-time computability of the Feigenbaum Julia set
Published online by Cambridge University Press: 21 July 2015
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.
- Type
- Research Article
- Information
- Copyright
- © Cambridge University Press, 2015
References
- 5
- Cited by