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
    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

    2 Documents citing this article

    Share and export

    Consultation statistics

    This page has been seen 1749 times.
    This article's PDF has been downloaded 1217 times.