ABSTRACT
The notion of a ‘sub-maximal’ measure of Kolmogorov Complexity is from the fact that an algorithmically random string is defined as one of a near maximal information content. A maximal information content string is a string whose minimal program is about the same length as the string itself because the string lacks a significant internal pattern that would allow it to be compressed more completely. By introducing a specifically valued element into a binary system of the program of a sequence of binary bit strings, a new result for the definition of random and non-random binary bit strings produces a new measure of Kolmogorov Complexity. Natural languages have inherent ambiguity that evades even the most accomplished ‘cartographers’ of the structure of language.
