{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:09:40Z","timestamp":1742400580828,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404934"},{"type":"electronic","value":"9783540450610"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_23","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:04Z","timestamp":1184601244000},"page":"267-277","source":"Crossref","is-referenced-by-count":4,"title":["Sophistication Revisited"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Antunes","sequence":"first","affiliation":[]},{"given":"Lance","family":"Fortnow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"23_CR1","unstructured":"L. Antunes. Useful Information. PhD Thesis, Computer Science Department, Oporto University, 2002."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Luis Antunes, Lance Fortnow, and Dieter van Melkebeek. Computational depth. In Proceedings of the 16th IEEE Conference on Computational Complexity, pages 266\u2013273, 2001.","DOI":"10.1109\/CCC.2001.933893"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"C. H. Bennett. Logical depth and physical complexity. In R. Herken, editor, The Universal Turing Machine: A Half-Century Survey, pages 227\u2013257. Oxford University Press, 1988.","DOI":"10.1093\/oso\/9780198537748.003.0008"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"T. M. Cover. Kolmogorov Complexity, Data Compression, and Inference, pp. 23\u201333. In The Impact of Processing Techniques on Communications. J. K. Skwirzynski, Ed., Martinus Nijhoff Publishers, 1985.","DOI":"10.1007\/978-94-009-5113-6_2"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/S0019-9958(82)80085-5","volume":"52","author":"R. P. Daley","year":"1982","unstructured":"Robert P. Daley Busy Beaver Sets: Characterizations and Applications. In Information and Control, 52(1982), 52\u201367.","journal-title":"Information and Control"},{"issue":"6","key":"23_CR6","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1109\/18.945257","volume":"47","author":"P. G\u00e1cs","year":"2001","unstructured":"Peter G\u00e1cs and John Tromp and Paul Vit\u00e1nyi. Algorithmic Statistics. In IEEE Trans. Inform. Theory, 47:6(2001), 2443\u20132463.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"M. Koppel. Structure, pp. 435\u2013452. In The Universal Turing Machine: A Half-Century Survey. R. Herken, Ed., Oxford University Press, 1988.","DOI":"10.1093\/oso\/9780198537748.003.0019"},{"key":"23_CR8","first-page":"85","volume":"7","author":"M. Koppel","year":"1991","unstructured":"M. Koppel. Learning to Predict Non-Deterministically Generated Strings. Machine Learning, 7(1991), 85\u201399.","journal-title":"Machine Learning"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0255(91)90021-L","volume":"56","author":"M. Koppel","year":"1991","unstructured":"M. Koppel and H. Atlan. An Almost Machine-Independent Theory of Program-Length Complexity, Sophistication, and Induction. Information Sciences, 56(1991), 23\u201333.","journal-title":"Information Sciences"},{"key":"23_CR10","first-page":"265","volume":"9","author":"L. A. Levin","year":"1973","unstructured":"Leonid A. Levin. Universal Search Problems. Problems Inform. Transmission, 9(1973), 265\u2013266.","journal-title":"Problems Inform. Transmission"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0019-9958(84)80060-1","volume":"61","author":"L. A. Levin","year":"1984","unstructured":"Leonid A. Levin. Randomness conservation inequalities: information and independence in mathematical theories. Information and Control, 61:15\u201337, 1984.","journal-title":"Information and Control"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Ming Li and Paul M. B. Vit\u00e1nyi. An introduction to Kolmogorov complexity and its applications. Springer, 2nd edition, 1997.","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C. P. Schnorr","year":"1973","unstructured":"C. P. Schnorr. Process Complexity and Effective Random Tests. J. Comp. System Sci., 7(1973), 376\u2013388.","journal-title":"J. Comp. System Sci."},{"key":"23_CR14","first-page":"295","volume":"28","author":"A. Kh. Shen","year":"1983","unstructured":"A. Kh. Shen. The Concept of (\u03b1, \u03b2)-Stochasticity in the Kolmogorov Sense, and its Properties. Soviet Math. Dokl., 28(1983), 295\u2013299.","journal-title":"Soviet Math. Dokl."},{"key":"23_CR15","unstructured":"N. Vereshchagin and P. Vit\u00e1nyi. Kolmogorov\u2019s structure functions and an application to the foundations of model selection. Proc. 47th IEEE Symp. Found. Comput. Sci., 2002."},{"key":"23_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/3-540-36136-7_51","volume-title":"Proc. 13th International Symposium on Algorithms and Computation","author":"P. Vit\u00e1nyi","year":"2002","unstructured":"P. Vit\u00e1nyi. Meaningful information. Proc. 13th International Symposium on Algorithms and Computation (ISAAC\u201902). Lecture Notes in Computer Science, Vol 2518, Springer-Verlag, Berlin, 2002, 588\u2013599."},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1093\/comjnl\/42.4.294","volume":"42","author":"V.V. Vyugin","year":"1999","unstructured":"V.V. V\u2019yugin. Algorithmic complexity and stochastic properties of finite binary sequences. The Computer Journal, 42(4):294\u2013317, 1999.","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:42:42Z","timestamp":1737286962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}