On computable approximations of Landau's constant

DOI10.2168/LMCS-8(4:15)2012zbMath1273.03145arXiv1209.5615MaRDI QIDQ4899115

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

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

Related Items (2)

Computability of Real Numbers ⋮ Computable Complex Analysis

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