I'm not sure you can calculate "organization" of a sequence, in a completely generic and universally applicable sense. It seems you would already have to know s

I'm not sure you can calculate "organization" of a sequence, in a completely generic and universally applicable sense. It seems you would already have to know something about how a sequence might be organized -- the constraints for a specific example / organization scheme. Digging through hypothetical organization that includes self reference would require an additional layer of understanding. Or in other words, wouldn't a sufficiently complex sequence be indistinguishable from random noise and the analysis would have to be outside of the expression system for at least some examples? This seems very related to the halting problem and the existence of proofs impossible to express in the base axiomatic system. It's been a long time since I studied finite state automatons, just a vague intuition from old memories. Edit: this is not to say that there couldn't be a practical measure of organization for specific examples/types/subsets of sequences. The halting problem doesn't prevent us from analyzing program "correctness" in specific formal systems. It just prevents us from having universal ability to fully determine the answer for a generic example.