Is there a 5-State binary tape Turing machine that halts in more than 47176870 steps?
10
Ṁ170Ṁ5.1kresolved Jul 3
Resolved
NO1H
6H
1D
1W
1M
ALL
In other words, is Marxen and Buntrock (1990)'s machine not the Busy Beaver? Resolves YES if and when a machine taking more than this many steps is proved to halt. Resolves NO if and when it is proven that all machines that do not halt in 47176870 steps never halt.
Close date updated to 2073-12-14 11:00 pm
This question is managed and resolved by Manifold.
Market context
Get 
1,000 to start trading!
1,000🏅 Top traders
| # | Trader | Total profit |
|---|---|---|
| 1 | Ṁ154 | |
| 2 | Ṁ92 | |
| 3 | Ṁ23 | |
| 4 | Ṁ7 | |
| 5 | Ṁ5 |