{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:39:39Z","timestamp":1725489579663},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656913"},{"type":"electronic","value":"9783540491163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_14","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:56:14Z","timestamp":1187254574000},"page":"153-162","source":"Crossref","is-referenced-by-count":1,"title":["Descriptive Complexity of Computable Sequences"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Durand","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Nikolai","family":"Vereshagin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/321495.321506","volume":"16","author":"G.J. Chaitin","year":"1969","unstructured":"G.J. Chaitin. \u201cOn the length of programs for computing finite binary sequences: statistical considerations,\u201d J. of ACM, 16:145\u2013159, 1969.","journal-title":"J. of ACM"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(76)90005-0","volume":"2","author":"G.J. Chaitin","year":"1976","unstructured":"G.J. Chaitin. \u201cInformation-theoretic characterizations of recursive infinite strings,\u201d Theor. Comp. Sci., 2:45\u201348, 1976.","journal-title":"Theor. Comp. Sci."},{"key":"14_CR3","series-title":"Lect Notes Comput Sci","volume-title":"MFCS\u201998","author":"B. Durand","year":"1998","unstructured":"B. Durand, S. Porrot. Comparison between the complexity of a function and the complexity of its graph. In MFCS\u201998. Lecture Notes in Computer Science, 1998."},{"issue":"1","key":"14_CR4","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"A.N. Kolmogorov. \u201cThree approaches to the quantitative definition of information.\u201d Problems of Information Transmission, 1(1):1\u20137, 1965.","journal-title":"Problems of Information Transmission"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"M. Li, P. Vit\u00e1nyi. An Introduction to Kolmogorov Complexity and its Applications. Second edition. Springer Verlag, 1997.","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","volume":"15","author":"D.W. Loveland","year":"1969","unstructured":"D.W. Loveland. \u201cA variant of Kolmogorov concept of Complexity\u201d, Information and Control, 15:510\u2013526, 1969.","journal-title":"Information and Control"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R.J. Solomonoff","year":"1964","unstructured":"R.J. Solomonoff. \u201cA formal theory of inductive inference, part 1 and part 2,\u201d Information and Control, 7:1\u201322, 224\u2013254, 1964.","journal-title":"Information and Control"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01201280","volume":"29","author":"V.A. Uspensky","year":"1996","unstructured":"V.A. Uspensky, A.Kh. Shen\u2019. \u201cRelations between varieties of Kolmogorov complexities,\u201d Math. Systems Theory, 29:271\u2013292, 1996.","journal-title":"Math. Systems Theory"},{"issue":"6","key":"14_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"A.K. Zvonkin, L.A. Levin. \u201cThe complexity of finite objects and the development of the concepts of information and randomness by means of theory of algorithms.\u201d Russian Math. Surveys, 25(6):83\u2013124, 1970.","journal-title":"Russian Math. Surveys"}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T18:22:09Z","timestamp":1550773329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}