Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
Dynamical Systems
2015-07-01 v3 Computational Complexity
Numerical Analysis
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.
Keywords
Cite
@article{arxiv.1410.3277,
title = {Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time},
author = {Peter Hertling and Christoph Spandl},
journal= {arXiv preprint arXiv:1410.3277},
year = {2015}
}
Comments
CCA 2012, Cambridge, UK, 24-27 June 2012