文章基本信息

标题：Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
本地全文：下载
作者：Peter Hertling ; Christoph Spandl
期刊名称：Logical Methods in Computer Science
印刷版ISSN：1860-5974
电子版ISSN：1860-5974
出版年度：2014
卷号：10
期号：4
页码：1
DOI：10.2168/LMCS-10(4:7)2014
出版社：Technical University of Braunschweig
摘要：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.