{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:34Z","timestamp":1725686674310},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308697"},{"type":"electronic","value":"9783642308703"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_4","type":"book-chapter","created":{"date-parts":[[2012,5,27]],"date-time":"2012-05-27T22:56:12Z","timestamp":1338159372000},"page":"29-34","source":"Crossref","is-referenced-by-count":0,"title":["Robustness of Logical Depth"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Antunes","sequence":"first","affiliation":[]},{"given":"Andre","family":"Souto","sequence":"additional","affiliation":[]},{"given":"Andreia","family":"Teixeira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Adriaans, P.: Facticity as the amount of self-descriptive information in a data set (2012)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s00224-007-9095-5","volume":"45","author":"L. Antunes","year":"2009","unstructured":"Antunes, L., Fortnow, L.: Sophistication revisited. Theory of Computing Systems\u00a045(1), 150\u2013161 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.tcs.2005.11.033","volume":"354","author":"L. Antunes","year":"2006","unstructured":"Antunes, L., Fortnow, L., van Melkebeek, D., Vinodchandran, N.: Computational depth: concept and applications. Theoretical Computer Science\u00a0354(3), 391\u2013404 (2006)","journal-title":"Theoretical Computer Science"},{"key":"4_CR4","first-page":"227","volume-title":"A half-Century Survey on the Universal Turing Machine","author":"C. Bennett","year":"1988","unstructured":"Bennett, C.: Logical depth and physical complexity. In: A half-Century Survey on the Universal Turing Machine, pp. 227\u2013257. Oxford University Press, Inc., New York (1988)"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G. Chaitin","year":"1966","unstructured":"Chaitin, G.: On the length of programs for computing finite binary sequences. Journal of ACM\u00a013(4), 547\u2013569 (1966)","journal-title":"Journal of ACM"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1002\/(SICI)1099-0526(199609\/10)2:1<44::AID-CPLX10>3.0.CO;2-X","volume":"2","author":"M. Gell-Mann","year":"1996","unstructured":"Gell-Mann, M., Lloyd, S.: Information measures, effective complexity, and total information. Complexity\u00a02(1), 44\u201352 (1996)","journal-title":"Complexity"},{"issue":"1","key":"4_CR7","first-page":"1","volume":"1","author":"A. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.: Three approaches to the quantitative definition of information. Problems of Information Transmission\u00a01(1), 1\u20137 (1965)","journal-title":"Problems of Information Transmission"},{"key":"4_CR8","first-page":"1087","volume":"1","author":"M. Koppel","year":"1987","unstructured":"Koppel, M.: Complexity, depth, and sophistication. Complex Systems\u00a01, 1087\u20131091 (1987)","journal-title":"Complex Systems"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Koppel, M.: Structure. The Universal Turing Machine: A Half-Century Survey, 2nd edn., pp. 403\u2013419. Springer (1995)","DOI":"10.1007\/978-3-7091-6597-3_19"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference, Part I. Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"Information and Control"},{"issue":"10","key":"4_CR12","doi-asserted-by":"publisher","first-page":"4617","DOI":"10.1109\/TIT.2006.881729","volume":"52","author":"P.M.B. Vit\u00e1nyi","year":"2006","unstructured":"Vit\u00e1nyi, P.M.B.: Meaningful information. IEEE Transactions on Information Theory\u00a052(10), 4617\u20134626 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/cplx.20165","volume":"12","author":"D.H. Wolpert","year":"2007","unstructured":"Wolpert, D.H., Macready, W.: Using self-dissimilarity to quantify complexity. Complexity\u00a012(3), 77\u201385 (2007)","journal-title":"Complexity"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:32:30Z","timestamp":1620113550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}