摘要：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.
其他关键词：Feigenbaum function; computable analysis; polynomial time computability.
