Papex

Open problem · Mathematics · since 2024 · Open

Antihydra

Starting from 4 and repeatedly applying n ↦ ⌊3n/2⌋ + 2, do the odd values ever outnumber twice the even values?

Summary

A 6-state Turing machine found among the undecided BB(6) machines in June 2024. It halts exactly when, starting from 4 and applying n ↦ ⌊3n/2⌋ + 2, the odd values come to outnumber twice the even ones, so BB(6) cannot be settled without this Collatz-like question. Its path behaves like an upward-drifting random walk, which suggests it never halts, but no proof is known.

Source

Open, as listed by Busy Beaver Challenge · bbchallenge wiki. Checked 06 Nov 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Mathematics