EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

The Largest Number Representable in 64 Bits

John Tromp iD

Entropy · 26.04.2026 · 28 (5) · 494

DOI: 10.3390/e28050494 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 26.04.2026. Verfasst von John Tromp. Beteiligte Einrichtung: Independent Researcher, 1111CP Diemen, The Netherlands. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We investigate how large an output can be computed by programs fitting inside a single register, using languages not designed for generating large outputs. We propose lambda calculus-based Busy Beaver functions that offer various advantages over the existing Turing machine-based ones, including a direct relation to Kolmogorov complexity.

Schlagwörter

Stichwörter der Autor:innen

Algorithmic Information TheoryKolmogorov complexityTuring machinebusy beaverlambda calculus

Autor:innen und Institutionen

  • Independent Researcher, 1111CP Diemen, The Netherlands.

ORCID-Profile: John Tromp

Zitieren

APA

Tromp, J. (2026). The Largest Number Representable in 64 Bits. Entropy, 28(5), 494. https://doi.org/10.3390/e28050494

Vancouver

Tromp J. The Largest Number Representable in 64 Bits. Entropy. 2026;28(5):494. doi:10.3390/e28050494

BibTeX
@article{Tromp2026,
  author = {Tromp, John},
  title = {The Largest Number Representable in 64 Bits},
  journal = {Entropy},
  year = {2026},
  volume = {28},
  number = {5},
  pages = {494},
  doi = {10.3390/e28050494}
}
Kostenlos starten →