@PeterCxy again, it is known that generalizations of the collatz sequence ( https://esolangs.org/wiki/Collatz_function ) are turing complete, it's unlikely the plain collatz sequence is turing complete but it's not outside the realm of possibility

some known models of computation are really, really simple, after all

some known models of computation are really, really simple, after all

Tᴀᴋᴀɴᴀsʜɪ Hᴏʀᴏ@[email protected]What if the thing really is Turing complete in some weird way like being able to encode a program in the initial seed number?