On the Computability of Blochs Constant

  • Authors:

  • Robert Rettinger

  • Affiliations:

  • FernUniversität Hagen, LG Komplexität und Algorithmen, Universitätsstrasse 1, D-58095 Hagen

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove the computability of Blochs constant by presenting the first algorithm for this constant.