Shawn K. Quinn 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 Sounds like an interesting problem to try to solve in Forth, especially since I haven't done any coding lately. I'm not sure if this has a name for it, but I'm reminded of a trick the programmers who worked on a pinball game called Banzai Run did: they ran out of sound board memory, and needed an "and" so they made it the "an" out of "welcome race fans" and called it a day.
