{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T04:25:57Z","timestamp":1778732757533,"version":"3.51.4"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2001,8]]},"abstract":"<jats:p> According to the Algorithmic Coding Theorem, minimal programs of any universal machine are prefix-codes asymptotically optimal (i.e. optimal up to at most an additive, unknown constant) with respect to the machine algorithmic probabilities. A stronger version of this result will be proven for a class of machines, not necessarily universal, and any semi-distribution. Furthermore, minimal programs with respect to universal machines will be shown to be almost optimal (i.e. optimal up to an additive constant less than or equal to 2) for any semi-computable semi-distribution. Finally, a complete characterization of all machines satisfying the Algorithmic Coding Theorem is given. <\/jats:p>","DOI":"10.1142\/s0129054101000606","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T06:59:39Z","timestamp":1027753179000},"page":"479-489","source":"Crossref","is-referenced-by-count":4,"title":["CODING WITH MINIMAL PROGRAMS"],"prefix":"10.1142","volume":"12","author":[{"given":"CRISTIAN S.","family":"CALUDE","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HAJIME","family":"ISHIHARA","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-1292, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TAKESHI","family":"YAMAGUCHI","sequence":"additional","affiliation":[{"name":"Department of Information Sciences, Tokyo Denki University, Hatoyama-Machi, Hiki-Gun, Saitama-Ken 350-0394, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02084158"},{"key":"p_3","first-page":"306","volume":"5","author":"Calude C.","year":"1996","journal-title":"J. Univ. Comput. ScL"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176991250"},{"key":"p_9","first-page":"1477","volume":"15","author":"Gacs P.","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1147\/rd.53.0183"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02435782"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.69.3413"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.53.3257"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.53.3387"},{"key":"p_15","first-page":"379","volume":"27","author":"Shannon C. E.","year":"1948","journal-title":"Journal"},{"key":"p_17","first-page":"393","author":"Zurek W. H.","year":"1999","journal-title":"Massachusetts"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054101000606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:46:34Z","timestamp":1565124394000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054101000606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":11,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2001,8]]}},"alternative-id":["10.1142\/S0129054101000606"],"URL":"https:\/\/doi.org\/10.1142\/s0129054101000606","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}