5 ms·
If 3x+1 is a programming language, the Collatz conjecture must be false as otherwise it would always halt. I suspect 3x+1 is not Turing complete.
by IIAOPSW 5y ago
If 3x+1 is a programming language, the Collatz conjecture must be false as otherwise it would always halt.
I suspect 3x+1 is not Turing complete.
- lostmsu 5y agoOr maybe it is, and Collatz conjecture is false.
- romwell 5y agoThat's the beauty of it, we don't know! Though honestly, I really wouldn't bet on ever getting anything other than the 4 - 2 - 1 loop out of it in the end.
- EthanHeilman 5y agoThe collatz could be false and still never halt. For instance the counter example could have an infinite number of numbers between it and 1. Perhaps the cycle found is infinite in length.
- EthanHeilman 5y agoI might be wrong here.