{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T15:27:48Z","timestamp":1769182068173,"version":"3.49.0"},"reference-count":52,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T00:00:00Z","timestamp":1654560000000},"content-version":"vor","delay-in-days":157,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p>\n                    One of the most fundamental problems in science is to define the complexity of organized matters quantitatively, that is, organized complexity. Although many definitions have been proposed toward this aim in previous decades (e.g., logical depth, effective complexity, natural complexity, thermodynamics depth, effective measure complexity, and statistical complexity), there is no agreed\u2010upon definition. The major issue of these definitions is that they captured only a single feature among the three key features of complexity, descriptive, computational, and distributional features, for example, the effective complexity captured only the descriptive feature, the logical depth captured only the computational, and the statistical complexity captured only the distributional. In addition, some definitions were not computable; some were not rigorously specified; and any of them treated either probabilistic or deterministic forms of objects, but not both in a unified manner. This paper presents a new quantitative definition of organized complexity. In contrast to the existing definitions, this new definition simultaneously captures all of the three key features of complexity for the first time. In addition, the proposed definition is computable, is rigorously specified, and can treat both probabilistic and deterministic forms of objects in a unified manner or seamlessly. The proposed definition is based on circuits rather than Turing machines and\n                    <jats:italic>\u025b<\/jats:italic>\n                    \u2010machines. We give several criteria required for organized complexity definitions and show that the proposed definition satisfies all of them.\n                  <\/jats:p>","DOI":"10.1155\/2022\/1889348","type":"journal-article","created":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T14:35:13Z","timestamp":1654612513000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Quantitative Definition of the Complexity of Organized Matters"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7803-812X","authenticated-orcid":false,"given":"Tatsuaki","family":"Okamoto","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2022,6,7]]},"reference":[{"key":"e_1_2_10_1_2","first-page":"536","article-title":"Science and complexity","volume":"36","author":"Weaver W.","year":"1948","journal-title":"American Scientist"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139225700"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_2_10_5_2","volume-title":"The Universal Turing Machine, A Half-Century Survey","author":"Bennett C. H.","year":"1988"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.6130010105"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/(sici)1099-0526(199609\/10)2:1<44::aid-cplx10>3.0.co;2-x"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195159769.003.0028"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12210-020-00972-0"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0701744104"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/3250301"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-16992-1"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4916(88)90094-2"},{"key":"e_1_2_10_14_2","first-page":"489","article-title":"Problems in quantifying self-generated complexity","volume":"62","author":"Grassberger P.","year":"1989","journal-title":"Helvetica Physica Acta"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.63.105"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(94)90273-9"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.59.275"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1023\/a:1010388907793"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13194-012-0056-8"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctv14rmpwc"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11298-1"},{"key":"e_1_2_10_22_2","volume-title":"Introduction to the Theory of Computation","author":"Sipser M.","year":"2013"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4"},{"key":"e_1_2_10_24_2","volume-title":"Information Theory and an Extension of the Maximum Likelihood Principle, Proceedings of the 2nd International Symposium on Information Theory","author":"Akaike H.","year":"1973"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1984.1056936"},{"key":"e_1_2_10_26_2","volume-title":"Stochastic Complexity in Statistical Inquiry","author":"Rissanen J.","year":"1989"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.plrev.2014.04.004"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/321495.321506"},{"key":"e_1_2_10_29_2","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov A. N.","year":"1965","journal-title":"Problems of Information Transmission"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0019-9958(64)90131-7"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.033"},{"key":"e_1_2_10_32_2","first-page":"265","article-title":"Universal search problems","volume":"9","author":"Levin L.","year":"1973","journal-title":"Problems of Information Transmission"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.1111\/1365-2656.12418"},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1201\/9780429455049"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-018-2601-8"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature10011"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1215508110"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.97.9.4463"},{"key":"e_1_2_10_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0057-3"},{"key":"e_1_2_10_40_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1558-5646.1996.tb03861.x"},{"key":"e_1_2_10_41_2","doi-asserted-by":"publisher","DOI":"10.1038\/423689a"},{"key":"e_1_2_10_42_2","volume-title":"A Mathematical Introduction to Logic S","author":"Enderton H. B.","year":"2011"},{"key":"e_1_2_10_43_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891"},{"key":"e_1_2_10_44_2","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen M. A.","year":"2000"},{"key":"e_1_2_10_45_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.3634009"},{"key":"e_1_2_10_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-005-9016-3"},{"key":"e_1_2_10_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0893-6080(96)00127-x"},{"key":"e_1_2_10_48_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0096223"},{"key":"e_1_2_10_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1986.1057132"},{"key":"e_1_2_10_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1977.1055714"},{"key":"e_1_2_10_51_2","doi-asserted-by":"publisher","DOI":"10.3390\/e22040408"},{"key":"e_1_2_10_52_2","volume-title":"The Design of Approximation Algorithms","author":"Williamson D. P.","year":"2010"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/1889348","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/2022\/1889348","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/1889348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:08:28Z","timestamp":1769116108000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2022\/1889348"}},"subtitle":[],"editor":[{"given":"Eric","family":"Campos","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1155\/2022\/1889348"],"URL":"https:\/\/doi.org\/10.1155\/2022\/1889348","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"2021-10-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1889348"}}