{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:23:07Z","timestamp":1740108187793,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T00:00:00Z","timestamp":1618531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T00:00:00Z","timestamp":1618531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00153-021-00769-4","type":"journal-article","created":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T22:02:45Z","timestamp":1618610565000},"page":"981-994","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pointwise complexity of the derivative of a computable function"],"prefix":"10.1007","volume":"60","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1835-9666","authenticated-orcid":false,"given":"Ethan","family":"McCarthy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,16]]},"reference":[{"key":"769_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3321699","volume":"66","author":"N Ackerman","year":"2010","unstructured":"Ackerman, N., Freer, C., Roy, D.: On the computability of conditional probability. J. ACM 66, 1 (2010). https:\/\/doi.org\/10.1145\/3321699","journal-title":"J. ACM"},{"issue":"1","key":"769_CR2","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1090\/tran\/6484","volume":"368","author":"V Brattka","year":"2016","unstructured":"Brattka, V., Miller, J.S., Nies, A.: Randomness and differentiability. Trans. Am. Math. Soc. 368(1), 581\u2013605 (2016). https:\/\/doi.org\/10.1090\/tran\/6484","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"769_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1090\/S0002-9904-1947-08757-7","volume":"53","author":"JA Clarkson","year":"1947","unstructured":"Clarkson, J.A.: A property of derivatives. Bull. Am. Math. Soc. 53(2), 124\u2013125 (1947)","journal-title":"Bull. Am. Math. Soc."},{"issue":"3","key":"769_CR4","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. Carolin. 16(3), 583\u2013599 (1975). (Russian)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"769_CR5","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer (2010). https:\/\/doi.org\/10.1007\/978-0-387-68441-3","DOI":"10.1007\/978-0-387-68441-3"},{"key":"769_CR6","doi-asserted-by":"crossref","unstructured":"Hoyrup, M., Rojas, C.: An application of Martin-L\u00f6f randomness to effective probability theory. In: Mathematical Theory and Computational Practice. CiE 2009, Lecture Notes in Computer Science, vol. 5635, pp. 260\u2013269. CiE. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03073-4_27"},{"key":"769_CR7","doi-asserted-by":"crossref","unstructured":"Hoyrup, M., Rojas, C.: Applications of effective probability theory to Martin-L\u00f6f randomness. In: 36th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 5555, pp. 549\u2013561. ICALP, Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02927-1_46"},{"key":"769_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-21875-0_14","volume-title":"Models Comput. Context","author":"M Hoyrup","year":"2011","unstructured":"Hoyrup, M., Rojas, C., Weihrauch, K.: Computability of the Radon\u2013Nikodym derivative. In: L\u00f6we, B., Normann, D., Soskov, I., Soskova, A. (eds.) Models Comput. Context, pp. 132\u2013141. Springer, Berlin (2011)"},{"issue":"1","key":"769_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00224-012-9422-3","volume":"52","author":"K Miyabe","year":"2013","unstructured":"Miyabe, K.: Characterization of Kurtz randomness by a differentiation theorem. Theory Comput. Syst. 52(1), 113\u2013132 (2013). https:\/\/doi.org\/10.1007\/s00224-012-9422-3","journal-title":"Theory Comput. Syst."},{"key":"769_CR10","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computabil. Randomness","author":"A Nies","year":"2009","unstructured":"Nies, A.: Computabil. Randomness. Oxford University Press Inc, New York, NY, USA (2009)"},{"issue":"1","key":"769_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1090\/S0002-9939-2013-11710-7","volume":"142","author":"N Pathak","year":"2014","unstructured":"Pathak, N., Rojas, C., Simpson, S.: Schnorr randomness and the Lebesgue differentiation theorem. Proc. Am. Math. Soc. 142(1), 335\u2013349 (2014). https:\/\/doi.org\/10.1090\/S0002-9939-2013-11710-7","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"769_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.23638\/LMCS-14(2:11)2018","volume":"14","author":"A Pauly","year":"2018","unstructured":"Pauly, A., Fouch\u00e9, W., Davie, G.: Weihrauch-completeness for layerwise computability. Logical Methods Comput. Sci. 14(2), 1 (2018). https:\/\/doi.org\/10.23638\/LMCS-14(2:11)2018","journal-title":"Logical Methods Comput. Sci."},{"key":"769_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"MB Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1989)"},{"key":"769_CR14","unstructured":"Rute, J.: Topics in Algorithmic Randomness and Computable Analysis. Ph.D. thesis, Carnegie Mellon University (2013)"},{"key":"769_CR15","unstructured":"Rute, J.: On the close interaction between algorithmic randomness and constructive\/computable measure theory. arXiv e-prints arXiv:1812.03375 (2018)"},{"key":"769_CR16","doi-asserted-by":"publisher","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, New York (2000)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-021-00769-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-021-00769-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-021-00769-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,24]],"date-time":"2022-12-24T14:47:41Z","timestamp":1671893261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-021-00769-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,16]]},"references-count":16,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["769"],"URL":"https:\/\/doi.org\/10.1007\/s00153-021-00769-4","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2021,4,16]]},"assertion":[{"value":"13 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data sharing statement"}},{"value":"The author declares that he has no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}