Computing a solution of Feigenbaum's functional equation in polynomial time

DOI10.2168/LMCS-10(4:7)2014MaRDI QIDQ2938761zbMATH OpenOpenAlexFDO

Authors Christoph Spandl, P. H. Hertling

Publication date 15 January 2015

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.3277

zbMATH Keywords

computable analysisFeigenbaum functionpolynomial time computability

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Analysis of algorithms and problem complexity (68Q25)

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.

Recommendations

• Poly-time computability of the Feigenbaum Julia set
• scientific article; zbMATH DE number 14589
• Relationships between the solutions of Feigenbaum's equation
• scientific article; zbMATH DE number 1150263
• A piecewise linear solution of Feigenbaum's equation

Cited in

(5)

• A function for evaluating the computing time of a bubbling system
• On the Lebesgue measure of the Feigenbaum Julia set
• On Lebesgue measure and Hausdorff dimension of Julia sets of real periodic points of renormalization
• Computability of Real Numbers
• Computer Science for Continuous Data

Describes a project that uses

Uses Software

• iRRAM

This page was built for publication: Computing a solution of Feigenbaum's functional equation in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938761)