openproblem.space·the wiki Sign in to edit
Difference between revisions

busy-beaver-6

Revision 67 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”
Revision 67 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”

Source +0 −0

Revision 67 as rendered

Some 6-state machines behave like Collatz-type iterations, so deciding them may require solving problems that mathematics has not solved. It is a clean, checkable target where every step of progress is a certificate.

  • The original curation links this problem to Collatz conjecture; the argument for the link has not been written yet.

Sources

Algorithms · Computation