{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T16:40:23Z","timestamp":1682354423932},"reference-count":26,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0096-3003(01)00199-0","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:55:52Z","timestamp":1032285352000},"page":"369-384","source":"Crossref","is-referenced-by-count":0,"title":["Entropic measures, Markov information sources and complexity"],"prefix":"10.1016","volume":"132","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]},{"given":"Monica","family":"Dumitrescu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0096-3003(01)00199-0_BIB1","series-title":"Statistical Inference for Stochastic Processes","author":"Basawa","year":"1980"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB2","doi-asserted-by":"crossref","unstructured":"W.A. Beyer, L. Stein, S.M. Ulam, The notion of complexity, Los Alamos Report LA-4822, 1971, US Department of Commerce, Springfield","DOI":"10.2172\/4700177"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB3","series-title":"Information and Randomness. An Algorithmic Perspective","author":"Calude","year":"1994"},{"issue":"22 July","key":"10.1016\/S0096-3003(01)00199-0_BIB4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1038\/22435","article-title":"Randomness everywhere","volume":"400","author":"Calude","year":"1999","journal-title":"Nature"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB5","unstructured":"C. Calude, I. Chi\u0163escu, Probabilities on the space of sequences, Technical Report No. 103, Computer Science Department, University of Auckland, New Zealand, 1994"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB6","unstructured":"C.S. Calude, H. Ishihara, T. Yamaguchi, Minimal programs are almost optimal, Int. J. Found. Comput. Sci. (in press)"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB7","series-title":"Papers on Algorithmic Information Theory","article-title":"Information, randomness and incompleteness","author":"Chaitin","year":"1987"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB8","series-title":"Algorithmic Information Theory","author":"Chaitin","year":"1987"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB9","series-title":"The Limits of Mathematics","author":"Chaitin","year":"1997"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB10","series-title":"The Unknowable","author":"Chaitin","year":"1999"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB11","series-title":"Exploring Randomness","author":"Chaitin","year":"2000"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB12","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1214\/aop\/1176991250","article-title":"Kolmogorov's contributions to information theory and algorithmic complexity","volume":"17","author":"Cover","year":"1989","journal-title":"Ann. Probab."},{"key":"10.1016\/S0096-3003(01)00199-0_BIB13","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB14","series-title":"Stochastic Processes","author":"Doob","year":"1953"},{"issue":"4","key":"10.1016\/S0096-3003(01)00199-0_BIB15","first-page":"429","article-title":"Some informational properties of Markov pure-jump processes","volume":"113","author":"Dumitrescu","year":"1988","journal-title":"Cas. P\u0115st. Mat."},{"issue":"4","key":"10.1016\/S0096-3003(01)00199-0_BIB16","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1142\/S0129054101000606","article-title":"Minimal programs are almost optimal","volume":"12","author":"Calude","year":"2001","journal-title":"J. Found. of Comput. Sci."},{"key":"10.1016\/S0096-3003(01)00199-0_BIB17","first-page":"1477","article-title":"On the symmetry of algorithmic information","volume":"15","author":"G\u00e1cs","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0096-3003(01)00199-0_BIB18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0012-365X(00)00100-X","article-title":"A proof of the Beyer\u2013Stein\u2013Ulam relation between complexity and entropy","volume":"223","author":"Galatolo","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0096-3003(01)00199-0_BIB19","series-title":"Information Theory and Applications","author":"Guia\u015fu","year":"1977"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB20","series-title":"Information Theory for Continuous Systems","author":"Ihara","year":"1993"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB21","series-title":"Finite Markov Chains","author":"Kemeny","year":"1960"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB22","first-page":"7","article-title":"A relation between complexity and entropy","volume":"3","author":"Lynch","year":"1995","journal-title":"Ulam Quart."},{"key":"10.1016\/S0096-3003(01)00199-0_BIB23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02435782","article-title":"Algorithmic information and simplicity in statistical physics","volume":"36","author":"Schack","year":"1997","journal-title":"Int. J. Theoret. Phys."},{"key":"10.1016\/S0096-3003(01)00199-0_BIB24","doi-asserted-by":"crossref","first-page":"379\u2013423, 623\u2013656","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0096-3003(01)00199-0_BIB25","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/S0096-3003(01)00199-0_BIB26","series-title":"Proc. Fundamentals of Computation Theory","first-page":"536","article-title":"The Kolmogorov complexity of real numbers","author":"Staiger","year":"1999"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300301001990?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300301001990?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T16:24:09Z","timestamp":1682353449000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300301001990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":26,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0096300301001990"],"URL":"https:\/\/doi.org\/10.1016\/s0096-3003(01)00199-0","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}