{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:05Z","timestamp":1725536825831},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_58","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"687-699","source":"Crossref","is-referenced-by-count":4,"title":["Partial Randomness and Dimension of Recursively Enumerable Reals"],"prefix":"10.1007","author":[{"given":"Kohtaro","family":"Tadaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0304-3975(99)00159-0","volume":"255","author":"C.S. Calude","year":"2001","unstructured":"Calude, C.S., Hertling, P.H., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin \u03a9 numbers. Theoret. Comput. Sci.\u00a0255, 125\u2013149 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.apal.2005.06.004","volume":"138","author":"C.S. Calude","year":"2006","unstructured":"Calude, C.S., Staiger, L., Terwijn, S.A.: On partial randomness. Annals of Pure and Applied Logic\u00a0138, 20\u201330 (2006)","journal-title":"Annals of Pure and Applied Logic"},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1016\/j.ic.2006.07.003","volume":"204","author":"C.S. Calude","year":"2006","unstructured":"Calude, C.S., Stay, M.A.: Natural halting probabilities, partial randomness, and zeta functions. Inform. and Comput.\u00a0204, 1718\u20131739 (2006)","journal-title":"Inform. and Comput."},{"key":"58_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to information theory. J. Assoc. Comput. Mach.\u00a022, 329\u2013340 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"key":"58_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608858","volume-title":"Algorithmic Information Theory","author":"G.J. Chaitin","year":"1987","unstructured":"Chaitin, G.J.: Algorithmic Information Theory. Cambridge University Press, Cambridge (1987)"},{"issue":"10","key":"58_CR6","doi-asserted-by":"publisher","first-page":"2574","DOI":"10.4249\/scholarpedia.2574","volume":"2","author":"R.G. Downey","year":"2007","unstructured":"Downey, R.G., Reimann, J.: Algorithmic randomness. Scholarpedia\u00a02(10), 2574 (2007); revision #37278, \n                    \n                      http:\/\/www.scholarpedia.org\/article\/Algorithmic_randomness","journal-title":"Scholarpedia"},{"issue":"1","key":"58_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/S0097539799357441","volume":"31","author":"A. Ku\u010dera","year":"2001","unstructured":"Ku\u010dera, A., Slaman, T.A.: Randomness and recursive enumerability. SIAM J. Comput.\u00a031(1), 199\u2013211 (2001)","journal-title":"SIAM J. Comput."},{"key":"58_CR8","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":"58_CR9","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":"58_CR10","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":"58_CR11","volume-title":"Proceedings of the 9th Asian Logic Conference","author":"J. Reimann","year":"2005","unstructured":"Reimann, J., Stephan, F.: On hierarchies of randomness tests. In: Proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, August 16-19. World Scientific Publishing, Singapore (2005)"},{"key":"58_CR12","first-page":"219","volume":"30","author":"B. Ya","year":"1984","unstructured":"Ya, B., Ryabko: Coding of combinatorial sources and Hausdorff dimension. Soviet Math. Dokl.\u00a030, 219\u2013222 (1984)","journal-title":"Soviet Math. Dokl."},{"key":"58_CR13","first-page":"170","volume":"22","author":"B. Ya","year":"1986","unstructured":"Ya, B., Ryabko: Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity. Problems Inform. Transmission\u00a022, 170\u2013179 (1986)","journal-title":"Problems Inform. Transmission"},{"key":"58_CR14","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C.-P. Schnorr","year":"1973","unstructured":"Schnorr, C.-P.: Process complexity and effective random tests. J. Comput. System Sci.\u00a07, 376\u2013388 (1973)","journal-title":"J. Comput. System Sci."},{"key":"58_CR15","unstructured":"Solovay, R.M.: Draft of a paper (or series of papers) on Chaitin\u2019s work ... done for the most part during the period of September\u2013December 1974. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, p. 215 (May 1975) (unpublished manuscript)"},{"key":"58_CR16","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":"58_CR17","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 Comput. Systems\u00a031, 215\u2013229 (1998)","journal-title":"Theory Comput. Systems"},{"key":"58_CR18","unstructured":"Tadaki, K.: Algorithmic information theory and fractal sets. In: Proceedings of 1999 Workshop on Information-Based Induction Sciences (IBIS 1999), Syuzenji, Shizuoka, Japan, August 26-27, pp. 105\u2013110 (1999) (in Japanese)"},{"key":"58_CR19","doi-asserted-by":"publisher","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":"58_CR20","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1002\/malq.200410061","volume":"52","author":"K. Tadaki","year":"2006","unstructured":"Tadaki, K.: An extension of Chaitin\u2019s halting probability \u03a9 to a measurement operator in an infinite dimensional quantum system. Math. Log. Quart.\u00a052, 419\u2013438 (2006)","journal-title":"Math. Log. Quart."},{"key":"#cr-split#-58_CR21.1","unstructured":"Tadaki, K.: A statistical mechanical interpretation of algorithmic information theory. In: Local Proceedings of Computability in Europe 2008 (CiE 2008), June 15-20, pp. 425???434. University of Athens, Greece (2008);"},{"key":"#cr-split#-58_CR21.2","unstructured":"Extended and Electronic Version,                                           http:\/\/arxiv.org\/abs\/0801.4194v1"},{"key":"58_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-92687-0_29","volume-title":"Logical Foundations of Computer Science","author":"K. Tadaki","year":"2008","unstructured":"Tadaki, K.: Fixed point theorems on partial randomness. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol.\u00a05407, pp. 422\u2013440. Springer, Heidelberg (2008)"},{"key":"58_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)"},{"issue":"6","key":"58_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surveys\u00a025(6), 83\u2013124 (1970)","journal-title":"Russian Math. Surveys"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:14:13Z","timestamp":1552119253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}