{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:24:04Z","timestamp":1726410244136},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_23","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"260-271","source":"Crossref","is-referenced-by-count":3,"title":["Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bienvenu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","first-page":"63","volume-title":"STACS 96","author":"K. Ambos-Spies","year":"1996","unstructured":"Ambos-Spies, K., et al.: Resource-bounded dense genericity, stochasticity, and weak randomness. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 63\u201374. Springer, Heidelberg (1996)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/1132070","volume":"32","author":"E. Asarin","year":"1987","unstructured":"Asarin, E.: Some properties of Kolmogorov \u0394-random sequences. Theory Probab. Appl.\u00a032, 507\u2013508 (1987)","journal-title":"Theory Probab. Appl."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness and complexity. Book in preparation","DOI":"10.1007\/978-0-387-68441-3"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","first-page":"6","volume-title":"New Computational Paradigms","author":"R. Downey","year":"2005","unstructured":"Downey, R., Merkle, W., Reimann, J.: Schnorr dimension. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 6\u2013105. Springer, Heidelberg (2005)"},{"issue":"6","key":"23_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.ipl.2004.05.014","volume":"91","author":"B. Durand","year":"2004","unstructured":"Durand, B., Vereshchagin, N.: Kolmogorov-Loveland stochasticity for finite strings. Information Processing Letters\u00a091(6), 263\u2013269 (2004)","journal-title":"Information Processing Letters"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/CCC.2000.856747","volume-title":"Proc. 15th Conference on Computational Complexity","author":"J. Lutz","year":"2000","unstructured":"Lutz, J.: Dimension in complexity classes. In: Proc. 15th Conference on Computational Complexity, pp. 158\u2013169. IEEE Computer Society Press, Los Alamitos (2000)"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"J. Lutz","year":"2003","unstructured":"Lutz, J.: The dimensions of individual strings and sequences. Information and Computation\u00a0187(1), 49\u201379 (2003)","journal-title":"Information and Computation"},{"key":"23_CR8","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vitanyi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Texts in Computer Science. Springer, Heidelberg (1997)","edition":"2"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(02)00343-5","volume":"84","author":"E. Mayordomo","year":"2002","unstructured":"Mayordomo, E.: A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters\u00a084, 1\u20133 (2002)","journal-title":"Information Processing Letters"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.2178\/jsl\/1067620192","volume":"68","author":"W. Merkle","year":"2003","unstructured":"Merkle, W.: The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences. Journal of Symbolic Logic\u00a068, 1362\u20131376 (2003)","journal-title":"Journal of Symbolic Logic"},{"issue":"1-3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.apal.2005.06.011","volume":"138","author":"W. Merkle","year":"2006","unstructured":"Merkle, W., et al.: Kolmogorov-Loveland Randomness and Stochasticity. Ann. Pure Appl. Logic\u00a0138(1-3), 183\u2013210 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(98)00069-3","volume":"207","author":"A.A. Muchnik","year":"1998","unstructured":"Muchnik, A.A., Semenov, A.L., Uspensky, V.A.: Mathematical metaphysics of randomness. Theor. Comput. Sci.\u00a0207(2), 263\u2013317 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR13","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0112459","volume-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","author":"C.P. Schnorr","year":"1971","unstructured":"Schnorr, C.P.: Zuf\u00e4lligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, vol.\u00a0218. Springer, Berlin (1971)"},{"key":"23_CR14","first-page":"316","volume":"38","author":"A. Shen","year":"1989","unstructured":"Shen, A.: On relations between different algorithmic definitions of randomness. Soviet Mathematics Doklady\u00a038, 316\u2013319 (1989)","journal-title":"Soviet Mathematics Doklady"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01203155","volume":"5","author":"R. Mises von","year":"1919","unstructured":"von Mises, R.: Grundlagen der Wahrscheinlichkeitsrechnung. Math. Z.\u00a05, 52\u201399 (1919)","journal-title":"Math. Z."},{"key":"23_CR16","unstructured":"van Lambalgen, M.: Random sequences. Ph.D. thesis, Univ. of Amsterdam, Amsterdam (1987)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:48Z","timestamp":1605762708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_23","relation":{},"subject":[]}}