On computable approximations of Landau's constant

DOI10.2168/LMCS-8(4:15)2012MaRDI QIDQ4899115zbMATH OpenFDO

Authors Robert Rettinger

Publication date 7 January 2013

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

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

zbMATH Keywords

algorithmcomputabilityLandau constant

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) General theory of conformal mappings (30C35) Constructive and recursive analysis (03F60)

Abstract: We present an algorithm which computes the Landau constant up to any given precision.

Recommendations

• Approximation formulas for the Landau constants
• Approximation formulas for Landau's constants
• Asymptotics of Landau constants with optimal error bounds
• scientific article; zbMATH DE number 1779454
• On some inequality for the Landau constants
• A note on the Landau constants
• On inequalities and asymptotic expansions for the Landau constants
• scientific article; zbMATH DE number 5781330
• Sharp bounds for the Landau constants
• Proofs of two conjectures on the Landau constants

Cited in

(2)

• Computability of Real Numbers
• Computable complex analysis

This page was built for publication: On computable approximations of Landau's constant

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