On Binary Encoding and Complexity

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

If you liked this post, please help up by spreading the word or by following us through email. Thank you 🙂