Shawn Ligocki personal blog
BB(3, 3) is Hard
I’m excited to share a 3 state, 3 symbol Turing Machine that cannot be proven to halt or not (when starting on a blank tape) without solving a Collatz-like problem. Therefore, solving the \(BB(3, 3)\) problem is at least as hard as solving this Collatz-like problem, a class of problem for which Paul Erdős famously…
- Points
- 316
- HN comments
- 132
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2023
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Oct 17, 2023 | BB(3, 3) is Hard by todsacerdoti | 316 | 132 |
