Which Collatz Numbers Do Busy Beavers Simulate (if Any)?
Posted3 months agoActive3 months ago
gbragafibra.github.ioResearchstory
calmpositive
Debate
10/100
Collatz ConjectureBusy BeaversTuring Machines
Key topics
Collatz Conjecture
Busy Beavers
Turing Machines
The article explores the connection between Busy Beavers and the Collatz Conjecture, sparking discussion on the computational implications and potential insights into these complex mathematical problems.
Snapshot generated from the HN discussion
Discussion Activity
Light discussionFirst comment
5d
Peak period
3
120-132h
Avg / period
3
Key moments
- 01Story posted
Oct 18, 2025 at 5:54 AM EDT
3 months ago
Step 01 - 02First comment
Oct 23, 2025 at 10:59 AM EDT
5d after posting
Step 02 - 03Peak activity
3 comments in 120-132h
Hottest window of the conversation
Step 03 - 04Latest activity
Oct 23, 2025 at 2:38 PM EDT
3 months ago
Step 04
Generating AI Summary...
Analyzing up to 500 comments to identify key contributors and discussion patterns
ID: 45626129Type: storyLast synced: 11/20/2025, 2:27:16 PM
Want the full context?
Jump to the original sources
Read the primary article or dive into the live Hacker News thread when you're ready.
E.g., the BB(5) machine [0] repeatedly multiplies a unary counter by 5/3 and adds a small offset, until the value becomes 2 mod 3 and the machine halts. In further domains, these kinds of "halt once a certain modular value is reached" conditions are used to terminate iterated exponentiation and higher operations.
The main similarity with the original Collatz iteration is that the machines repeatedly divide out a certain factor to produce a pseudorandom stream of remainders. In some cases, a machine measures a statistical property of the stream that is expected to hold forever, but cannot easily be proven to do so, as in the infamous Hydra/Antihydra machines [1].
Somewhat curiously, a candidate for the BB(3,3) champion machine [2] does not use any sort of Collatz-like modular-value conditions. Instead, it repeatedly samples points and compares them against the subdivisions of a sort of Cantor set, until one of the points perfectly hits the edge of a subdivision. It's expected to halt after roughly 10^135 iterations.
[0] https://wiki.bbchallenge.org/wiki/5-state_busy_beaver_winner
[1] https://www.sligocki.com/2024/07/06/bb-6-2-is-hard.html
[2] https://wiki.bbchallenge.org/wiki/1RB2LC1RC_2LC---2RB_2LA0LB...