Is there a 5-State binary tape Turing machine that halts in more than 47176870 steps?
8
71
Ṁ1.6KṀ170
2073
4%
chance
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
Get Ṁ200 play money
Related questions
In 2029, will any AI be able to take an arbitrary proof in the mathematical literature and translate it into a form suitable for symbolic verification? (Gary Marcus benchmark #5)
39% chance
Will a quantum computer perform a calculation by 2026 that is impossible for any classical supercomputer?
49% chance
Will IBM be the first to create a quantum computer with over 10,000 qubits?
61% chance
Will there be a quantum computer with 100,000 functioning qbits before 2035?
64% chance
Will the majority of mathematicians rely on formal computer proof assistants before the end of 2040?
64% chance
Will a quantum computer factor a 6-bit number before 2026?
25% chance
What fraction of Turing machines implement halting functions?
Will any corporate quantum computing team report 2 or more simultaneous 2-qubit gates with >= 99.9% fidelity by 2025?
81% chance
What fraction of Turing machines implement computable functions?
Will any model pass an "undergrad proofs exam" Turing test by 2027?
74% chance