{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T07:54:53Z","timestamp":1672646093112},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T00:00:00Z","timestamp":1341360000000},"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-9416-1","type":"journal-article","created":{"date-parts":[[2012,7,7]],"date-time":"2012-07-07T12:20:59Z","timestamp":1341663659000},"page":"48-64","source":"Crossref","is-referenced-by-count":1,"title":["Effective Randomness of Unions and Intersections"],"prefix":"10.1007","volume":"52","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rebecca","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,4]]},"reference":[{"key":"9416_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/11780342_6","volume-title":"Logical Approaches to Computational Barriers","author":"B.C.P. Brodhead","year":"2006","unstructured":"Brodhead, B.C.P., Cenzer, D., Dashti, S.: Random closed sets. In: Beckmann, A., Berger, U., L\u00f6we,\u00a0B., Tucker, J.V. (eds.) Logical Approaches to Computational Barriers. Lecture Notes in Computer Science, vol. 3988, pp. 55\u201364. Springer, Berlin (2006)"},{"key":"9416_CR2","doi-asserted-by":"crossref","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. Log. Comput. 17, 1041\u20131062 (2007)","journal-title":"J. Log. Comput."},{"issue":"3","key":"9416_CR3","first-page":"1","volume":"7","author":"P. Brodhead","year":"2011","unstructured":"Brodhead, P., Cenzer, D., Toska, F., Wyman, S.: Algorithmic randomness and capacity of closed sets. Log. Methods Comput. Sci. 7(3), 1\u201316 (2011)","journal-title":"Log. Methods Comput. Sci."},{"key":"9416_CR4","unstructured":"Cenzer, C.D., Remmel, J.B.: Effectively Closed Sets. Book Manuscript (2013, to appear)"},{"key":"9416_CR5","series-title":"Elsevier Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/S0049-237X(98)80046-3","volume-title":"Handbook of Recursive Mathematics. Vol.\u00a02. Recursive Algebra, Analysis and Combinatorics","author":"D. Cenzer","year":"1998","unstructured":"Cenzer, D., Remmel, J.B.: $\\varPi^{0}_{1}$ classes. In: Ersov, Y., Goncharov, S., Marek, V., Nerode, A., Remmel, J. (eds.) Handbook of Recursive Mathematics. Vol.\u00a02. Recursive Algebra, Analysis and Combinatorics. Elsevier Studies in Logic and the Foundations of Mathematics, vol. 139, pp. 623\u2013821 (1998)"},{"key":"9416_CR6","doi-asserted-by":"crossref","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-Walton processes. Ann. Pure Appl. Log. 163, 519\u2013529 (2012)","journal-title":"Ann. Pure Appl. Log."},{"key":"9416_CR7","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"M.L.P. Martin-L\u00f6f","year":"1966","unstructured":"Martin-L\u00f6f, M.L.P.: The definition of random sequences. Inf. Control 9, 602\u2013619 (1966)","journal-title":"Inf. Control"},{"key":"9416_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and Randomness","author":"N.A. Nies","year":"2009","unstructured":"Nies, N.A.: Computability and Randomness. Oxford University Press, Oxford (2009)"},{"key":"9416_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"S.R. Soare","year":"1987","unstructured":"Soare, S.R.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)"},{"key":"9416_CR10","unstructured":"van Lambalgen, v.M.: Random sequences. Ph.D. Dissertation, University of Amsterdam (1987)"},{"key":"9416_CR11","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01203155","volume":"5","author":"R. Mises von","year":"1919","unstructured":"von Mises, R.: Grundlagen der Wahrscheinlichkeitsrechnung. Math. Z. 5, 52\u201399 (1919)","journal-title":"Math. Z."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9416-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9416-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9416-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:24Z","timestamp":1558684464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9416-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,4]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9416"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9416-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,4]]}}}