@somebody we should chat. i completely revised the chomsky hierarchy so that it corresponds to literal complexity classes from linear/regular => stack/quadratic => undecidable (this includes dual stacks). one thing that's important to remember is that fuckboys constantly steal from real scientists.
it is awful that we lost the potential to make real scientific progress in the past half-century but you are certainly not flawed or misguided to have identified that there was a real potential that these losers squandered
@somebody unsure if this helps. personally i am incredibly glad that LLMs literally don't do recurrence at all because i care SO MUCH about data integrity i think there is a path to taking advantage of that for unstructured finite-length byte streams. the reason i was thinking about this at all was because i have never seen a literal symmetric cipher proposed that makes use of global permutations
