3 ms·
TLDR; As BB(n) gets larger, they can encode more random walk style problems that have a stop condition related to the position of the random walk. Proving that
by russdill 1y ago
TLDR; As BB(n) gets larger, they can encode more random walk style problems that have a stop condition related to the position of the random walk. Proving that such a condition is unlikely may be easy, but proving it never occurs is very difficult.
- gbacon 1y agoWay worse than just very difficult: - “Avoid the Collatz Conjecture at All Costs!” (Math Kook) https://www.youtube.com/watch?v=TxBRcwkRjmc https://www.youtube.com/watch?v=TxBRcwkRjmc - “Experienced mathematicians warn up-and-comers to stay away from the Collatz conjecture. It’s a siren song, they say: Fall under its trance and you may never do meaningful work again.” https://www.quantamagazine.org/mathematician-proves-huge-result-on-dangerous-problem-20191211/ https://www.quantamagazine.org/mathematician-proves-huge-res... - "Mathematics is not yet ready for such problems [as Collatz].” (Paul Erdős)