- Thread starter
- #1

This leads to my question.

Could we take nested logs of a number, such that to a certain degree of accuracy, we reduce its length to the smallest possible. where the base of the logs are relatively small integer values. Then decode the number later on using the bases as a key.

so for 1234567 we might have [ (log(base 3) , 5) ];[ ( log (base 23) , 7 ] ; [ ( log (base 9) , 1 ]

as tuple entries in the complete represntation with two sets being (5 , 7 , 1) and the bases ( 3 , 23 , 9 ).

with this information we can contract 1234567 to 571, which is shorter than it is and much shorter than logging it to the base 10.even if we are forced to append the key , we still have a smaller representation than the log one.

Also , because of the way base 10 numbers oscillate in representation as we go through the natural numbers, could there be an optimal key in the sense that , while there may be better keys for particular numbers that are all different, could we have one master key that contracts ALL natural numbers to a size that is the relatively lowest size that will be possible for all of them.

Note this key would probably have to be a progression of some sorts to cater for variable length of numbers.

This would not for encryption purposes, since everyone will know the key. But for example in machine learning algorithms learn to generalize input that is represented in numbers. This is limited in that the numbers cannot go too high because of the storage requirements needed o represent very large numbers. The algorithms also ONLY need to detect a pattern, even if it is placed under transformation. If we can transform the representation using this system , then the ML algorithm will still learn as well as it did before while the computer will be using less , more manageable resources.