PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 3, 2026Entropy0 citationsOpen Access

The Largest Number Representable in 64 Bits

View Full Paper
JTJohn Tromp

Key Points

  • The aim is to determine the largest value computable by programs constrained to 64-bit registers.
  • Proposed lambda calculus-based Busy Beaver functions
  • Compared advantages over traditional Turing machine-based functions
  • Established a direct relation to Kolmogorov complexity
  • Demonstrated potential for larger outputs than previously established by Turing machines
  • Provided insights into the relationship between lambda calculus and computational complexity
  • Highlighted efficiency improvements in program output generation

Abstract

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

John Tromp (2026) studied this question.

synapsesocial.com/papers/69f6e6648071d4f1bdfc70a0https://doi.org/10.3390/e28050494
Ask AI
Helpful
Bookmark
Share
View Full Paper