{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:00:12Z","timestamp":1743141612453,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_14","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"183-195","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmically Independent Sequences"],"prefix":"10.1007","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]},{"given":"Marius","family":"Zimand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73001-9_7","volume-title":"Computation and Logic in the Real World","author":"L. Bienvenu","year":"2007","unstructured":"Bienvenu, L., Doty, D., Stephan, F.: Constructive dimension and weak truth-table degrees. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497. Springer, Heidelberg (to appear, 2007) Available as Technical Report arXiv:cs\/0701089 ar arxiv.org"},{"key":"14_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04978-5","volume-title":"Information and Randomness: An Algorithmic Perspective, Revised and Extended","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S.: Information and Randomness: An Algorithmic Perspective, Revised and Extended, 2nd edn. Springer, Berlin (2002)","edition":"2"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.apal.2005.06.004","volume":"138","author":"C. Calude","year":"2006","unstructured":"Calude, C., Staiger, L., Terwijn, S.: On partial randomness. Annals of Pure and Applied Logic\u00a0138, 20\u201330 (2006)","journal-title":"Annals of Pure and Applied Logic"},{"key":"14_CR4","first-page":"25","volume":"317","author":"C.S. Calude","year":"2008","unstructured":"Calude, C.S., Zimand, M.: Algorithmically Independent Sequences. CDMTCS Research Report\u00a0317, p. 25 (2008)","journal-title":"CDMTCS Research Report"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G. Chaitin","year":"1975","unstructured":"Chaitin, G.: A theory of program size formally identical to information theory. Journal of the ACM\u00a022, 329\u2013340 (1975)","journal-title":"Journal of the ACM"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1007\/BF02084159","volume":"21","author":"G. Chaitin","year":"1982","unstructured":"Chaitin, G.: G\u00f6del\u2019s theorem and information. International Journal of Theoretical Physics\u00a021, 941\u2013954 (1982)","journal-title":"International Journal of Theoretical Physics"},{"key":"14_CR7","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer, Heidelberg (to be published)"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.2178\/bsl\/1154698741","volume":"12","author":"R. Downey","year":"2006","unstructured":"Downey, R., Hirschfeldt, D., Nies, A., Terwijn, S.: Calibrating randomness. The Bulletin of Symbolic Logic\u00a012(3), 411\u2013492 (2006)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"14_CR9","unstructured":"Gr\u00fcnwald, P., Vitanyi, P.: Shannon information and Kolmogorov complexity, 2004. CORR Technical report arxiv:cs.IT\/0410002, revised (May 2006)"},{"key":"14_CR10","unstructured":"Kautz, S.M.: Independence properties of algorithmically random sequences, CORR Technical Report arXiv:cs\/0301013 (2003)"},{"issue":"1","key":"14_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0019-9958(84)80060-1","volume":"61","author":"Leonid A. Levin","year":"1984","unstructured":"Levin, L.: Randomness conservation inequalities: information and independence in mathematical theories. Information and Control\u00a061(1) (1984)","journal-title":"Information and Control"},{"key":"14_CR12","first-page":"49","volume":"187","author":"J. Lutz","year":"2003","unstructured":"Lutz, J.: The dimensions of individual strings and sequences. Information and Control\u00a0187, 49\u201379 (2003)","journal-title":"Information and Control"},{"key":"14_CR13","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":"14_CR14","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":"14_CR15","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.aim.2004.10.006","volume":"197","author":"A. Nies","year":"2005","unstructured":"Nies, A.: Lowness properties and randomness. Advances in Mathematics\u00a0197, 274\u2013305 (2005)","journal-title":"Advances in Mathematics"},{"key":"14_CR16","unstructured":"Nies, A., Reimann, J.: A lower cone in the wtt degrees of non-integral effective dimension. In: Proceedings of IMS workshop on Computational Prospects of Infinity, Singapore (to appear, 2006)"},{"key":"14_CR17","unstructured":"Reimann, J.: Computability and fractal dimension, Technical report, Universit\u00e4t Heidelberg, Ph.D. thesis (2004)"},{"key":"14_CR18","first-page":"1066","volume":"277","author":"B. Ryabko","year":"1984","unstructured":"Ryabko, B.: Coding of combinatorial sources and Hausdorff dimension. Doklady Akademii Nauk SSR\u00a0277, 1066\u20131070 (1984)","journal-title":"Doklady Akademii Nauk SSR"},{"key":"14_CR19","unstructured":"Solovay, R.: Draft of a paper (or series of papers) on Chaitin\u2019s work, unpublished manuscript, IBM Thomas J. Watson Reserach Center, pages 215 (1975)"},{"key":"14_CR20","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":"14_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ipl.2004.09.023","volume":"93","author":"L. Staiger","year":"2005","unstructured":"Staiger, L.: Constructive dimension equals Kolmogorov complexity. Information Processing Letters\u00a093, 149\u2013153 (2005)","journal-title":"Information Processing Letters"},{"key":"14_CR22","unstructured":"Stephan, F.: Email communication (May 2007)"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.14492\/hokmj\/1350911778","volume":"31","author":"K. Tadaki","year":"2002","unstructured":"Tadaki, K.: A generalization of Chaitin\u2019s halting probability \u03a9 and halting self-similar sets. Hokkaido Math. J.\u00a031, 219\u2013253 (2002)","journal-title":"Hokkaido Math. J."},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.2307\/2274480","volume":"55","author":"M. van Lambalgen","year":"1990","unstructured":"van Lambalgen, M.: The axiomatization of randomness. The Journal of Symbolic Logic\u00a055, 1143\u20131167 (1990)","journal-title":"The Journal of Symbolic Logic"},{"key":"14_CR25","unstructured":"Zambella, D.: On sequences with simple initial segments, ILLC Technical Report ML 1990-05, University of Amsterdam (1990)"},{"key":"14_CR26","unstructured":"Zimand, M.: Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. In: Proceedings of CSR 2008, Moscow (June 2008) (Also available as CORR Techical Report. arXiv:0705.4658)"},{"issue":"6","key":"14_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/rm1970v025n06ABEH001269","volume":"25","author":"A. Zvonkin","year":"1970","unstructured":"Zvonkin, A., Levin, L.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys\u00a025(6), 83\u2013124 (1970)","journal-title":"Russian Mathematical Surveys"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T21:30:36Z","timestamp":1675719036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}