ABSTRACT
As can be seen from the use of the ‘symbolic space multiplier program’ on strings of binary bits, the compression factor used to define a level of randomness in a binary bit string is lowered from the standard model of Kolmogoroc Complexity allowing for a new measure of randomness in Algorithmic information Theory and Kolmogoroc Complexity. When both a radix 3 based character system, a ternary based system, and a radix 4 based system, a quaternary system, are introduced to the ‘symbolic space multiplier program’, a sub maximal measures of Kolmogoroc Complexity results that parallels those found using the binary bit strings. When both the ternary and quaternary based systems are used in the ‘modified symbolic space multiplier program’ considerable compression results with both the ternary and quaternary based systems achieving fifty percent compressions in their respective strings.
