arXiv · 1410.3277
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
Abstract
Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular that the so-called first Feigenbaum constant is a polynomial time computable real number.
Explore related subjects
Keep this discovery
Peter Hertling, Christoph Spandl. 2014-10-13. Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time. https://doi.org/10.2168/lmcs-10(4:7)2014
Cite the original work for its findings. Save a collection to share your selection of sources.