On Binary Encoding and Complexity

Y: about your memory allocation trick; so basically; we could have a 6-bit structure that allows us 64 variations; and no ID; that’s correct right?; one thing I learn from the Braille; is actually you can have more than 64 with 6 bits; and this is used quite extensively in codes; so basically it’s to say that IF > THEN; like shift key basically; for example; we could say that whenever there are 111111 followed by another 111111 then some kind of shift key is pushed; so if I understand correct; actually we could use 6 bits to represent a potentially endless list of things; but that is tricky; the design is very tricky; as you suggested earlier with binary systems in general; basically the more “compressed” you want to make it; the trickier it gets; so again; what we should do is; is allow the machine to do this for as well; so basically; we give it a list of things; and it runs scenarios to find the best base first; and then use that base to it’s theoretical max efficiency