Difference between revisions
busy-beaver-6
Status and infobox
- status:
—→ open - kind:
—→ problem - year:
—→ 1962 - statement:
—→ Determine the maximum number of steps of a halting 6-state, 2-symbol Turing machine.
Relations
- + related to collatz-conjecture: The original curation links this problem to Collatz conjecture; the argument for the link has not been written yet.
Source +19 −0
+---
+title: Busy Beaver BB(6)
+kind: problem
+status: open
+year: 1962
+statement: Determine the maximum number of steps of a halting 6-state, 2-symbol Turing machine.
+space: algorithms
+---
+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.
+
+## Related problems
+
+- The original curation links this problem to [[related::Problem:collatz-conjecture|Collatz conjecture]]; the argument for the link has not been written yet.
+
+## Sources
+
+- [bbchallenge.org](https://bbchallenge.org/)
+
+[[Space:algorithms|Algorithms]] · [[Continent:computation|Computation]]
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.
Related problems
- The original curation links this problem to Collatz conjecture; the argument for the link has not been written yet.