Antihydra's odd-even frequency conjecture
Statement
Consider the map defined by
Starting from , classify each iterate as odd or even. Antihydra's odd-even frequency conjecture. At no point in the iteration are there strictly more than twice as many odd numbers as even numbers. This conjecture is presented as equivalent to nonhalting of the six-state Antihydra Turing machine from the all-zero tape. The source does not state whether the conjecture itself has been proved or disproved.
Record
- Source
- The bbchallenge Collaboration, Justin Blanchard, Daniel Briggs, Konrad Deka, Nathan Fenner, Yannick Forster, Georgi Georgiev, Matthew L. House, Rachel Hunter, Iijil, Maja Kądziołka, Pavel Kropitz, Shawn Ligocki, mxdys, Mateusz Naściszewski, savask, Tristan Stérin, Chris Xu, Jason Yuen and Théo Zimmermann, “Determination of the fifth Busy Beaver value”, arXiv:2509.12337 (2026).
- MathDB
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.