Abstract
A function, B(x) is introduced which assigns a real number to a string, x, which is intended to be a measure of the randomness of x. Comparisons are made between B(x) and K(x), the Kolmogorov complexity of x. A O(n3) algorithm for computing B(x) is given, along with brief descriptions of experimental results showing the efficacy of this function in practical situations.
Cite
CITATION STYLE
Frayman, F., Kanevsky, V., & Kirchherr, W. (1994). The combinatorial complexity of a finite string. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 841 LNCS, pp. 364–372). Springer Verlag. https://doi.org/10.1007/3-540-58338-6_83
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
