What if the thing really is Turing complete in some weird way like being able to encode a program in the initial seed number?

@PeterCxy Kolmogorov complexity defines the complexity of an object as the theoretically shortest program capable of generating it. So seemingly complex things such as digits of pi or fractals actually do not contain any real information using this definition.

@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
Sign in to participate in the conversation

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!