Is there a postulate between a toolset's ability to reduce entropy and Turing completeness?
I feel like most of the "X is Turing complete" posts are essentially saying "X can decrease entropy to an arbitrary fidelity" (while also having some simulation rules that run over the altered system).
Adam's Postulate: any sufficiently complex system can probably be coaxed in to reducing entropy in such a way that a set of simulation rules can act as an abstraction layer to form programmable systems.
