Hertling, Peter and Spandl, Christoph - Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time

lmcs:984 - Logical Methods in Computer Science, December 9, 2014, Volume 10, Issue 4
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time

Authors: Hertling, Peter and Spandl, Christoph

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.


Source : oai:arXiv.org:1410.3277
DOI : 10.2168/LMCS-10(4:7)2014
Volume: Volume 10, Issue 4
Published on: December 9, 2014
Submitted on: June 25, 2015
Keywords: Mathematics - Dynamical Systems,Computer Science - Computational Complexity,Computer Science - Numerical Analysis


Share

Browsing statistics

This page has been seen 25 times.
This article's PDF has been downloaded 8 times.