ABSTRACT
The standard definition of a measure of randomness to be found in a random string of binary bits has been examined using the ‘symbolic space multiplier program’ with the result a new measure to the notion of randomness of Kolmogorov Complexity. While this research was directed at random binary bit strings as defined by algorithmic information theory the developments beyond these parameters has lead to the introduction of both the radix 3 based and the radix 4 based character systems to both algorithmic information theory and later to information theory. The compression factor of almost one third to a random binary bit string using the ‘symbolic space multiplier program’ and the compression by half of the ternary and quaternary based systems to random strings using the ‘modified symbolic space multiplier program’ have deep theoretical and applied relevance beyond the fields of algorithmic information theory and information theory.
