Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time

Peter Hertling; Christoph Spandl

doi:10.2168/LMCS-10(4:7)2014

Peter Hertling ; Christoph Spandl - 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 - https://doi.org/10.2168/LMCS-10(4:7)2014

Computing a Solution of Feigenbaum's Functional Equation in Polynomial TimeArticle

Authors: Peter Hertling ; Christoph Spandl

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.

Comment: CCA 2012, Cambridge, UK, 24-27 June 2012

https://doi.org/10.2168/LMCS-10(4:7)2014

Source: arXiv.org:1410.3277

Volume: Volume 10, Issue 4

Secondary volumes: Selected Papers of the 9th International Conference on Computability and Complexity in Analysis (CCA 2012)

Published on: December 9, 2014

Imported on: February 21, 2013

Keywords: Mathematics - Dynamical Systems, Computer Science - Computational Complexity, Mathematics - Numerical Analysis

Licence: arXiv.org - Non-exclusive license to distribute