BB(10) > Graham's Number
surprisetalk
65 points
61 comments
October 13, 2026
Related Discussions
Found 5 related stories in 85.3ms across 9,386 title embeddings via pgvector HNSW
- Bb: The IDE that builds itself williswee · 21 pts · August 12, 2026 · 45% similar
- Show HN: QBasic Gorillas (Repeeled) TonyAlicea10 · 25 pts · July 16, 2026 · 44% similar
- The Integer hactually · 19 pts · August 19, 2026 · 43% similar
- 10 REM"_(C2SLFF4 ingve · 165 pts · July 22, 2026 · 42% similar
- PostHog MCP Analytics: an 8bit tale lucasheriques · 15 pts · October 05, 2026 · 41% similar
Discussion Highlights (3 comments)
kekqqq
I fail to understand why this is interesting or relevant. The README is very non-human-generated and hard to parse or understand.
philipwhiuk
One problem with LLMs in academic contexts is that because you're paying by the token, it's resulting in extremely short papers that don't adequately explain the context. It's the same problem with long-standing short papers. And this is a fine example of this.
deanCommie
IMHO an output of a function being bigger than Graham's number isn't particularly impressive. Consider TREE(3) -> https://www.youtube.com/watch?v=3P6DWAwwViU Graham's Number is notable for being one of the first, being an actual relevant bound in an unrelated proof (not just the output of a function), of teaching people the Up Arrow Notation. To me, BB(10), TREE(3) etc. being so large is only minorly more impressive than GG(1) where I define I define GG(x) as "Graham's Number + X"