{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T10:12:40Z","timestamp":1773828760172,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540249986","type":"print"},{"value":"9783540318569","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_35","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"422-433","source":"Crossref","is-referenced-by-count":1,"title":["Kolmogorov-Loveland Randomness and Stochasticity"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Merkle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nies","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Reimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Contemp. Math.","first-page":"1","volume-title":"Computability theory and its applications","author":"K. Ambos-Spies","year":"2000","unstructured":"Ambos-Spies, K., Ku\u010dera, A.: Randomness in computability theory. In: Computability theory and its applications, Boulder, CO. Contemp. Math., vol.\u00a0257, pp. 1\u201314. Amer. Math. Soc., Providence (2000)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1137\/S0097539798343891","volume":"30","author":"H. Buhrman","year":"2000","unstructured":"Buhrman, H., van Melkebeek, D., Regan, K.W., Sivakumar, D., Strauss, M.: A generalization of resource-bounded measure, with application to the BPP vs. EXP problem. SIAM J. Comput.\u00a030, 576\u2013601 (2000)","journal-title":"SIAM J. Comput."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/S0022-0000(05)80073-X","volume":"49","author":"J.Y. Cai","year":"1994","unstructured":"Cai, J.Y., Hartmanis, J.: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. J. Comput. System Sci.\u00a049, 605\u2013619 (1994)","journal-title":"J. Comput. System Sci."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R., Hirschfeldt, D., Nies, A., Terwijn, S.: Calibrating randomness. Bulletin of Symbolic Logic (to appear)","DOI":"10.2178\/bsl\/1154698741"},{"key":"35_CR5","series-title":"Graduate 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., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications. Graduate Texts in Computer Science. Springer, New York (1997)"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1007\/3-540-45022-X_76","volume-title":"Automata, Languages and Programming","author":"J.H. Lutz","year":"2000","unstructured":"Lutz, J.H.: Gales and the constructive dimension of individual sequences. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 902\u2013913. Springer, Heidelberg (2000)"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"Martin-L\u00f6f, P.: The definition of random sequences. Information and Control\u00a09, 602\u2013619 (1966)","journal-title":"Information and Control"},{"key":"35_CR8","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. Inform. Process. Lett.\u00a084, 1\u20133 (2002)","journal-title":"Inform. Process. Lett."},{"key":"35_CR9","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. J. Symbolic Logic\u00a068, 1362\u20131376 (2003)","journal-title":"J. Symbolic Logic"},{"key":"35_CR10","unstructured":"Merkle, W., Miller, J., Nies, A., Reimann, J., Stephan, F.: Kolmogorov-Loveland randomness and stochasticity. Annals of Pure and Applied Logic (to appear)"},{"key":"35_CR11","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. Theoret. Comput. Sci.\u00a0207, 263\u2013317 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR12","volume-title":"Classical recursion theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical recursion theory. North-Holland, Amsterdam (1989)"},{"key":"35_CR13","unstructured":"Reimann, J.: Computability and fractal dimension. Doctoral Dissertation, Universit\u00e4t Heidelberg, Heidelberg, Germany (2004)"},{"key":"35_CR14","first-page":"219","volume":"30","author":"B.Y. Ryabko","year":"1984","unstructured":"Ryabko, B.Y.: Coding of combinatorial sources and Hausdorff dimension. Sov. Math. Dokl.\u00a030, 219\u2013222 (1984)","journal-title":"Sov. Math. Dokl."},{"key":"35_CR15","first-page":"170","volume":"22","author":"B.Y. Ryabko","year":"1986","unstructured":"Ryabko, B.Y.: Noiseless coding of combinatorial sources, Hausdorff dimension and Kolmogorov complexity. Probl. Information Transmission\u00a022, 170\u2013179 (1986)","journal-title":"Probl. Information Transmission"},{"key":"35_CR16","unstructured":"Ryabko, B.Y.: Private communication (April 2003)"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1017","volume":"103","author":"L. Staiger","year":"1993","unstructured":"Staiger, L.: Kolmogorov complexity and Hausdorff dimension. Inform. and Comput.\u00a0103, 159\u2013194 (1993)","journal-title":"Inform. and Comput."},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s002240000086","volume":"31","author":"L. Staiger","year":"1998","unstructured":"Staiger, L.: A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems\u00a031, 215\u2013229 (1998)","journal-title":"Theory of Computing Systems"},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1070\/RM1990v045n01ABEH002321","volume":"45","author":"V.A. Uspensky","year":"1990","unstructured":"Uspensky, V.A., Semenov, A.L., Shen, A.K.: Can an (individual) sequence of zeros and ones be random? Russian Math. Surveys\u00a045, 121\u2013189 (1990)","journal-title":"Russian Math. Surveys"},{"key":"35_CR20","unstructured":"Van Lambalgen, M.: Random sequences. Doctoral Dissertation, Universiteit van Amsterdam, Amsterdam, Netherlands (1987)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:29:48Z","timestamp":1605742188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}