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

DOI10.2168/LMCS-10(4:7)2014zbMath1448.03035arXiv1410.3277OpenAlexW2165633953MaRDI QIDQ2938761

Christoph Spandl, Peter 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 analysispolynomial time computabilityFeigenbaum function

Mathematics Subject Classification ID

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

Related Items (3)

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

Uses Software

• iRRAM

This page was built for publication: Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time