Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
arXiv:1410.3277 · doi:10.2168/LMCS-10(4:7)2014
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.
CCA 2012, Cambridge, UK, 24-27 June 2012