{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:38:58Z","timestamp":1777516738998,"version":"3.51.4"},"reference-count":24,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2016,12,22]]},"DOI":"10.3233\/com-160058","type":"journal-article","created":{"date-parts":[[2016,12,23]],"date-time":"2016-12-23T21:42:09Z","timestamp":1482529329000},"page":"79-104","source":"Crossref","is-referenced-by-count":1,"title":["Computability on measurable functions"],"prefix":"10.1177","volume":"6","author":[{"given":"Klaus","family":"Weihrauch","sequence":"first","affiliation":[{"name":"Mathematics and Computer Science, University of Hagen, 58084 Hagen, Germany. klaus.weihrauch@fernuni-hagen.de."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/COM-160058_ref1","doi-asserted-by":"crossref","unstructured":"V. Brattka, P. Hertling and K. Weihrauch, A tutorial on computable analysis, in: New Computational Paradigms: Changing Conceptions of What Is Computable, S.B. Cooper, B. L\u00f6we and A. Sorbi, eds, Springer, New York, 2008, pp. 425\u2013491.","DOI":"10.1007\/978-0-387-68546-5_18"},{"key":"10.3233\/COM-160058_ref2","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.tcs.2012.01.011","article-title":"Effectively approximating measurable sets by open sets","volume":"428","author":"Conidis","year":"2012","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/COM-160058_ref3","unstructured":"P. G\u00e1cs, M. Hoyrup and C. Rojas, Randomness on computable probability spaces \u2013 A dynamical point of view, in: STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science, LIPIcs. Leibniz Int. Proc. Inform., Vol. 3, Schloss Dagstuhl. Leibniz-Zent. Inform, Wadern, 2009, pp. 469\u2013480."},{"issue":"3","key":"10.3233\/COM-160058_ref4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s00224-010-9263-x","article-title":"Randomness on computable probability spaces \u2013 A dynamical point of view","volume":"48","author":"G\u00e1cs","year":"2011","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10.3233\/COM-160058_ref5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ic.2009.05.001","article-title":"Effective symbolic dynamics, random points, statistical behavior, complexity and entropy","volume":"208","author":"Galatolo","year":"2010","journal-title":"Inform. and Comput."},{"issue":"7","key":"10.3233\/COM-160058_ref6","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1016\/j.ic.2008.12.009","article-title":"Computability of probability measures and Martin\u2013L\u00f6f randomness over metric spaces","volume":"207","author":"Hoyrup","year":"2009","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.3233\/COM-160058_ref7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/COM-2012-005","article-title":"Computability of the Radon\u2013Nikodym derivative","volume":"1","author":"Hoyrup","year":"2012","journal-title":"Computability"},{"key":"10.3233\/COM-160058_ref8","doi-asserted-by":"crossref","unstructured":"A. Kawamura and S. Cook, Complexity theory for operators in analysis, in: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC \u201910, ACM, New York, 2010, pp. 495\u2013502.","DOI":"10.1145\/1806689.1806758"},{"issue":"1","key":"10.3233\/COM-160058_ref9","doi-asserted-by":"crossref","first-page":"6","DOI":"10.2168\/LMCS-10(1:6)2014","article-title":"Computational complexity of smooth differential equations","volume":"10","author":"Kawamura","year":"2014","journal-title":"Logical Methods in Computer Science"},{"issue":"1","key":"10.3233\/COM-160058_ref10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.3233\/COM-13015","article-title":"L 1 -computability, layerwise computability and Solovay reducibility","volume":"2","author":"Kenshi","year":"2013","journal-title":"Computability"},{"key":"10.3233\/COM-160058_ref11","unstructured":"K.-I. Ko, Complexity Theory of Real Functions, Progress in Theoretical Computer Science, Birkh\u00e4user, Boston, 1991."},{"key":"10.3233\/COM-160058_ref12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0304-3975(98)00292-8","article-title":"Computability on random variables","volume":"219","author":"M\u00fcller","year":"1999","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10.3233\/COM-160058_ref13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.2168\/LMCS-9(4:14)2013","article-title":"Products of effective topological spaces and a uniformly computable Tychonoff theorem","volume":"9","author":"Rettinger","year":"2013","journal-title":"Logical Methods in Computer Science"},{"issue":"6","key":"10.3233\/COM-160058_ref14","first-page":"956","article-title":"Notions of probabilistic computability on represented spaces","volume":"14","author":"Volker","year":"2008","journal-title":"Journal of Universal Computer Science"},{"key":"10.3233\/COM-160058_ref15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(93)90001-A","article-title":"Computability on computable metric spaces","volume":"113","author":"Weihrauch","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/COM-160058_ref16","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0304-3975(98)00298-9","article-title":"Computability on the probability measures on the Borel sets of the unit interval","volume":"219","author":"Weihrauch","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/COM-160058_ref17","doi-asserted-by":"crossref","unstructured":"K. Weihrauch, Computable Analysis, Springer, Berlin, 2000.","DOI":"10.1007\/978-3-642-56999-9"},{"issue":"6","key":"10.3233\/COM-160058_ref18","first-page":"801","article-title":"The computable multi-functions on multi-represented sets are closed under programming","volume":"14","author":"Weihrauch","year":"2008","journal-title":"Journal of Universal Computer Science"},{"issue":"6","key":"10.3233\/COM-160058_ref19","first-page":"1381","article-title":"Elementary computable topology","volume":"15","author":"Weihrauch","year":"2009","journal-title":"Journal of Universal Computer Science"},{"issue":"3","key":"10.3233\/COM-160058_ref20","doi-asserted-by":"crossref","first-page":"7","DOI":"10.2168\/LMCS-10(3:7)2014","article-title":"Representations of measurable sets in computable measure theory","volume":"10","author":"Weihrauch","year":"2014","journal-title":"Logical Methods in Computer Science"},{"key":"10.3233\/COM-160058_ref21","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2012.06.027","article-title":"Computability on random events and variables in a computable probability space","volume":"460","author":"Wu","year":"2012","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"10.3233\/COM-160058_ref22","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1002\/malq.200510008","article-title":"Computability of measurable sets via effective metrics","volume":"51","author":"Wu","year":"2005","journal-title":"Mathematical Logic Quarterly"},{"issue":"3","key":"10.3233\/COM-160058_ref23","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s00153-005-0315-x","article-title":"Computability of measurable sets via effective topologies","volume":"45","author":"Wu","year":"2006","journal-title":"Archive for Mathematical Logic"},{"issue":"1\u20133","key":"10.3233\/COM-160058_ref24","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.01.050","article-title":"A computable version of the Daniell\u2013Stone theorem on integration and linear functionals","volume":"359","author":"Wu","year":"2006","journal-title":"Theoretical Computer Science"}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-160058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:59:51Z","timestamp":1777391991000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-160058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,22]]},"references-count":24,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/com-160058","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"value":"2211-3576","type":"electronic"},{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12,22]]}}}