jorty (deprecated aspect) is a user on octodon.social. You can follow them or interact with them if you have an account anywhere in the fediverse.
If you don't, you can sign up here.
uhhhh hmm
let’s say I want to store the ASCII integer representations of values 0..15 inclusive in memory
if I allow the memory to overlap I can represent it as
151413121109876
thus 15 and 5 overlap, 11 and 10 overlap
this *might* be the shortest possible representation
is there already a known algorithm for this? is this problem called something?
@iliana reminds me of a prefix tree (or suffix tree in this case) with a flat representation (I forget what they call that kind of representation)
@iliana but I'm tired so maybe that's nonsense