{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:40:32Z","timestamp":1742913632835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_4","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"23-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmically Random Functions and Effective Capacities"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[]},{"given":"Christopher P.","family":"Porter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"4_CR1","unstructured":"Axon, L.M.: Algorithmically random closed sets and probability. PhD thesis, University of Notre Dame (2010)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1093\/logcom\/exm033","volume":"17","author":"G Barmpalias","year":"2007","unstructured":"Barmpalias, G., Brodhead, P., Cenzer, D., Dashti, S., Weber, R.: Algorithmic randomness of closed sets. J. Logic Comput. 17, 1041\u20131062 (2007)","journal-title":"J. Logic Comput."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s00153-007-0060-4","volume":"46","author":"G Barmpalias","year":"2008","unstructured":"Barmpalias, G., Brodhead, P., Cenzer, D., Remmel, J.B., Weber, R.: Algorithmic randomness of continuous functions. Arch. Math. Logic 46, 533\u2013546 (2008)","journal-title":"Arch. Math. Logic"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1093\/logcom\/exn021","volume":"19","author":"G Barmpalias","year":"2009","unstructured":"Barmpalias, G., Cenzer, D., Remmel, J.B., Weber, R.: $$k$$-triviality of closed sets and continuous functions. J. Logic Comput. 19, 3\u201316 (2009)","journal-title":"J. Logic Comput."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2012.06.031","volume":"459","author":"L Bienvenu","year":"2012","unstructured":"Bienvenu, L., Porter, C.: Strong reductions in effective randomness. Theoret. Comput. Sci. 459, 55\u201368 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.entcs.2006.08.016","volume":"167","author":"P Brodhead","year":"2007","unstructured":"Brodhead, P., Cenzer, D., Remmel, J.B.: Random continuous functions. Electron. Notes Theor. Comput. Sci. 167, 275\u2013287 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"4_CR7","first-page":"1","volume":"6","author":"D Cenzer","year":"2011","unstructured":"Cenzer, D., Brodhead, P., Toska, F., Wyman, S.: Algorithmic randomness and capacity of closed sets. Log. Methods Comput. Sci. 6, 1\u201316 (2011)","journal-title":"Log. Methods Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.apal.2011.06.010","volume":"163","author":"D Diamondstone","year":"2012","unstructured":"Diamondstone, D., Kjos-Hanssen, B.: Martin-L\u00f6f randomness and galton-watson processes. Ann. Pure Appl. Logic 163, 519\u2013529 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"4_CR9","volume-title":"Algorithmic Randomness Complex.","author":"R Downey","year":"2011","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness Complex. Springer, Heidelberg (2011)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P Martin-Lof","year":"1966","unstructured":"Martin-Lof, P.: The definition of random sequences. Inf. Control 9, 602\u2013619 (1966)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:22:52Z","timestamp":1676445772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}