{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T04:07:17Z","timestamp":1773115637291,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,8,5]],"date-time":"2012-08-05T00:00:00Z","timestamp":1344124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00224-012-9422-3","type":"journal-article","created":{"date-parts":[[2012,8,4]],"date-time":"2012-08-04T08:50:06Z","timestamp":1344070206000},"page":"113-132","source":"Crossref","is-referenced-by-count":4,"title":["Characterization of Kurtz Randomness by a Differentiation Theorem"],"prefix":"10.1007","volume":"52","author":[{"given":"Kenshi","family":"Miyabe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,5]]},"reference":[{"issue":"2","key":"9422_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/S0305004100022453","volume":"41","author":"A.S. Besicovitch","year":"1945","unstructured":"Besicovitch, A.S.: A general form of the covering principle and relative differentiation of additive functions. Proc. Camb. Philos. Soc. 41(2), 103\u2013110 (1945)","journal-title":"Proc. Camb. Philos. Soc."},{"issue":"6","key":"9422_CR2","first-page":"956","volume":"14","author":"V. Bosserhoff","year":"2008","unstructured":"Bosserhoff, V.: Notions of probabilistic computability on represented spaces. J. Univers. Comput. Sci. 14(6), 956\u2013995 (2008)","journal-title":"J. Univers. Comput. Sci."},{"key":"9422_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-1-4615-0755-0_5","volume-title":"Computability and Models","author":"V. Brattka","year":"2003","unstructured":"Brattka, V.: Computability over topological structures. In: Cooper, S.B., Goncharov, S.S. (eds.) Computability and Models, pp. 93\u2013136. Kluwer Academic, New York (2003)"},{"key":"9422_CR4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-0-387-68546-5_18","volume-title":"New Computational Paradigms","author":"V. Brattka","year":"2008","unstructured":"Brattka, V., Hertling, P., Weihrauch, K.: A tutorial on computable analysis. In: New Computational Paradigms, pp.\u00a0425\u2013491 (2008)"},{"key":"9422_CR5","unstructured":"Brattka, V., Miller, J.S., Nies, A.: Randomness and differentiability (2012, submitted)"},{"issue":"3","key":"9422_CR6","first-page":"583","volume":"16","author":"O. Demuth","year":"1975","unstructured":"Demuth, O.: The differentiability of constructive functions of weakly bounded variation on pseudo numbers. Comment. Math. Univ. Carol. 16(3), 583\u2013599 (1975)","journal-title":"Comment. Math. Univ. Carol."},{"key":"9422_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"R. Downey","year":"2010","unstructured":"Downey, R., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Berlin (2010)"},{"key":"9422_CR8","unstructured":"Freer, C., Kjos-Hanssen, B., Nies, A.: Computable aspects of Lipshitz functions. In preparation"},{"key":"9422_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.tcs.2005.03.054","volume":"341","author":"P. G\u00e1cs","year":"2005","unstructured":"G\u00e1cs, P.: Uniform test of algorithmic randomness over a general space. Theor. Comput. Sci. 341, 91\u2013137 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9422_CR10","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s00224-010-9263-x","volume":"48","author":"P. G\u00e1cs","year":"2011","unstructured":"G\u00e1cs, P., Hoyrup, M., Rojas, C.: Randomness on computable probability spaces\u2014a dynamical point of view. Theory Comput. Syst. 48(3), 465\u2013485 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"21\u201323","key":"9422_CR11","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1016\/j.tcs.2009.02.010","volume":"410","author":"S. Galatolo","year":"2009","unstructured":"Galatolo, S., Hoyrup, M., Rojas, C.: A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties. Theor. Comput. Sci. 410(21\u201323), 2207\u20132222 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9422_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ic.2009.05.001","volume":"208","author":"S. Galatolo","year":"2010","unstructured":"Galatolo, S., Hoyrup, M., Rojas, C.: Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Inf. Comput. 208(1), 23\u201341 (2010)","journal-title":"Inf. Comput."},{"issue":"7","key":"9422_CR13","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1016\/j.ic.2008.12.009","volume":"207","author":"M. Hoyrup","year":"2009","unstructured":"Hoyrup, M., Rojas, C.: Computability of probability measures and Martin-L\u00f6f randomness over metric spaces. Inf. Comput. 207(7), 830\u2013847 (2009)","journal-title":"Inf. Comput."},{"key":"9422_CR14","unstructured":"Kurtz, S.A.: Randomness and genericity in the degrees of unsolvability. PhD thesis, University of Illinois at Urbana-Champaign (1981)"},{"key":"9422_CR15","volume-title":"Le\u00e7ons sur l\u2019Int\u00e9gration et la Recherche des Fonctions Primitives","author":"H. Lebesgue","year":"1904","unstructured":"Lebesgue, H.: Le\u00e7ons sur l\u2019Int\u00e9gration et la Recherche des Fonctions Primitives. Gauthier-Villars, Paris (1904)"},{"key":"9422_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.24033\/asens.624","volume":"27","author":"H. Lebesgue","year":"1910","unstructured":"Lebesgue, H.: Sur l\u2019int\u00e9gration des fonctions discontinues. Ann. Sci. \u00c9c. Norm. Super. 27, 361\u2013450 (1910)","journal-title":"Ann. Sci. \u00c9c. Norm. Super."},{"key":"9422_CR17","series-title":"Graduate Texts in Computer Science","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"2009","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Graduate Texts in Computer Science. Springer, New York (2009)","edition":"3"},{"key":"9422_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and Randomness","author":"A. Nies","year":"2009","unstructured":"Nies, A.: Computability and Randomness. Oxford University Press, London (2009)"},{"key":"9422_CR19","doi-asserted-by":"crossref","unstructured":"Pathak, N., Rojas, C., Simpson, S.G.: Schnorr randomness and the Lebesgue Differentiation Theorem. Proc. Am. Math. Soc. (2012, to appear)","DOI":"10.1090\/S0002-9939-2013-11710-7"},{"issue":"4\u20135","key":"9422_CR20","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/malq.200710010","volume":"53","author":"M. Schr\u00f6der","year":"2007","unstructured":"Schr\u00f6der, M.: Admissible representations for probability measures. Math. Log. Q. 53(4\u20135), 431\u2013445 (2007)","journal-title":"Math. Log. Q."},{"issue":"2","key":"9422_CR21","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1090\/S0002-9947-1988-0951621-8","volume":"308","author":"J. Tiser","year":"1988","unstructured":"Tiser, J.: Differentiation theorem for Gaussian measures on Hilbert space. Trans. Am. Math. Soc. 308(2), 655\u2013666 (1988)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"9422_CR22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1111\/j.2517-6161.1993.tb01482.x","volume":"55","author":"V. Vovk","year":"1993","unstructured":"Vovk, V., Vyugin, V.: On the empirical validity of the Bayesian method. J. R. Stat. Soc. B 55(1), 253\u2013266 (1993)","journal-title":"J. R. Stat. Soc. B"},{"key":"9422_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: An Introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction. Springer, Berlin (2000)"},{"issue":"6","key":"9422_CR24","first-page":"1381","volume":"15","author":"K. Weihrauch","year":"2009","unstructured":"Weihrauch, K., Grubba, T.: Elementary computable topology. J. Univers. Comput. Sci. 15(6), 1381\u20131422 (2009)","journal-title":"J. Univers. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9422-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9422-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9422-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T05:28:31Z","timestamp":1714282111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9422-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,5]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9422"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9422-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,5]]}}}