{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T22:47:21Z","timestamp":1770158841925,"version":"3.49.0"},"reference-count":30,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:00:00Z","timestamp":1770076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2515246"],"award-info":[{"award-number":["2515246"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Kolmogorov complexity of a finite binary word reflects both algorithmic structure and the empirical distribution of symbols appearing in the word. Words with symbol frequencies far from one half belong to smaller combinatorial classes and therefore appear less complex under the standard definition. In this paper, an entropy-normalized complexity measure is introduced that divides the Kolmogorov complexity of a word by the empirical entropy of its observed distribution of zeros and ones. This adjustment isolates intrinsic descriptive complexity from the purely combinatorial effect of symbol imbalance. For Martin\u2013L\u00f6f random sequences under constructive exchangeable measures, the adjusted complexity grows linearly and converges to one. A pathological construction shows that regularity of the underlying measure is essential. The proposed framework connects Kolmogorov complexity, empirical entropy, and randomness in a natural manner and suggests applications in randomness testing and in the analysis of structured binary data.<\/jats:p>","DOI":"10.3390\/e28020176","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T10:03:29Z","timestamp":1770113009000},"page":"176","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adjusted Kolmogorov Complexity of Binary Words with Empirical Entropy Normalization"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9155-9325","authenticated-orcid":false,"given":"Brani","family":"Vidakovic","sequence":"first","affiliation":[{"name":"Statistics Department, Texas A&M University, College Station, TX 77843, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,2,3]]},"reference":[{"key":"ref_1","first-page":"369","article-title":"On Tables of Random Numbers","volume":"25","author":"Kolmogorov","year":"1963","journal-title":"Sankhy\u0101 Ser. A"},{"key":"ref_2","first-page":"1","article-title":"Three Approaches to the Quantitative Definition of Information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Probl. Inf. Transm."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The Complexity of Finite Objects and the Development of the Concepts of Information and Randomness by Means of the Theory of Algorithms","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russ. Math. Surv."},{"key":"ref_4","first-page":"206","article-title":"Laws of Information Conservation (Non-growth) and Aspects of the Foundation of Probability Theory","volume":"10","author":"Levin","year":"1974","journal-title":"Probl. Inf. Transm."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/BF01694181","article-title":"A Unified Approach to the Definition of Random Sequences","volume":"5","author":"Schnorr","year":"1971","journal-title":"Math. Syst. Theory"},{"key":"ref_6","first-page":"359","article-title":"On algorithmic complexity, universal priors and Ockham\u2019s razor","volume":"3","author":"Vidakovic","year":"1998","journal-title":"Resen. Inst. Matem\u00e1tica Estat\u00edstica Univ. S\u00e3o Paulo"},{"key":"ref_7","first-page":"249","article-title":"On Information and Complexity","volume":"21","author":"Kramosil","year":"1985","journal-title":"Kybernetika"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Calude, C.S. (2002). Information and Randomness: An Algorithmic Perspective, Springer. [2nd ed.]. Texts in Theoretical Computer Science. An EATCS Series.","DOI":"10.1007\/978-3-662-04978-5"},{"key":"ref_9","first-page":"235","article-title":"Some Characteristics of the Process Measure of the Amount of Information","volume":"33","author":"Vidakovic","year":"1983","journal-title":"Publ. L\u2019institut Math. Nouv. Ser."},{"key":"ref_10","first-page":"143","article-title":"Some Properties of the Combinational Measure of Complexity of Binary Words","volume":"42","author":"Vidakovic","year":"1987","journal-title":"Publ. L\u2019institut Math. Nouv. Ser."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The Definition of Random Sequences","volume":"9","year":"1966","journal-title":"Inf. Control"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Li, M., and Vit\u00e1nyi, P.M.B. (2008). An Introduction to Kolmogorov Complexity and Its Applications, Springer. [3rd ed.].","DOI":"10.1007\/978-0-387-49820-1"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Downey, R.G., and Hirschfeldt, D.R. (2010). Algorithmic Randomness and Complexity; Theory and Applications of Computability, Springer.","DOI":"10.1007\/978-0-387-68441-3"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Nies, A. (2009). Computability and Randomness, Oxford University Press. Oxford Logic Guides.","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"ref_15","first-page":"1","article-title":"La pr\u00e9vision: Ses lois logiques, ses sources subjectives","volume":"7","year":"1937","journal-title":"Annales de l\u2019Institut Henri Poincar\u00e9"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process Complexity and Effective Random Tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the Complexity of Finite Sequences","volume":"22","author":"Lempel","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley-Interscience. [2nd ed.]."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1109\/18.54897","article-title":"Information-Theoretic Asymptotics of Bayes Methods","volume":"36","author":"Clarke","year":"1990","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","article-title":"Data Compression Using Adaptive Coding and Partial String Matching","volume":"32","author":"Cleary","year":"1984","journal-title":"IEEE Trans. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1007\/BF00668821","article-title":"Toward a Quantitative Theory of Self-Generated Complexity","volume":"25","author":"Grassberger","year":"1986","journal-title":"Int. J. Theor. Phys."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","article-title":"Modeling by Shortest Data Description","volume":"14","author":"Rissanen","year":"1978","journal-title":"Automatica"},{"key":"ref_23","unstructured":"OEIS Foundation Inc. (2026, January 26). The Thue\u2013Morse Sequence (A010060). Available online: https:\/\/oeis.org\/A010060\/internal."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2443","DOI":"10.1109\/18.945257","article-title":"Algorithmic Statistics","volume":"47","author":"Tromp","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Bormashenko, E. (2020). Entropy, Information, and Symmetry: Ordered Is Symmetrical. Entropy, 22.","DOI":"10.3390\/e22020235"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Bormashenko, E. (2020). Symmetry and Entropy. Entropy, 22.","DOI":"10.3390\/e22020235"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A Formal Theory of Inductive Inference. Part I","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inf. Control"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A Formal Theory of Inductive Inference. Part II","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inf. Control"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","article-title":"A Theory of Program Size Formally Identical to Information Theory","volume":"22","author":"Chaitin","year":"1975","journal-title":"J. ACM"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2738","DOI":"10.1103\/PhysRevA.51.2738","article-title":"Quantum Coding","volume":"51","author":"Schumacher","year":"1995","journal-title":"Phys. Rev. A"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/2\/176\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T10:06:48Z","timestamp":1770113208000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/2\/176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,3]]},"references-count":30,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["e28020176"],"URL":"https:\/\/doi.org\/10.3390\/e28020176","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,3]]}}}