{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T00:17:19Z","timestamp":1706660239821},"reference-count":18,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2019,8,1]]},"DOI":"10.1215\/00294527-2019-0017","type":"journal-article","created":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T02:03:41Z","timestamp":1562810621000},"source":"Crossref","is-referenced-by-count":0,"title":["Martin-L\u00f6f Randomness Implies Multiple Recurrence in Effectively Closed Sets"],"prefix":"10.1215","volume":"60","author":[{"given":"Rodney G.","family":"Downey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyadev","family":"Nandakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nies","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"13","unstructured":"[13] Nies, A., editor, <i>Logic Blog 2016<\/i> (blog), <a href=\"arxiv.org\/abs\/1703.01573\">arxiv.org\/abs\/1703.01573<\/a>."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Downey, R. G., and D. R. Hirschfeldt, <i>Algorithmic Randomness and Complexity<\/i>, Springer, New York, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Nies, A., <i>Computability and Randomness<\/i>, vol. 51 of <i>Oxford Logic Guides<\/i>, Oxford University Press, Oxford, 2009.","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Bienvenu, L., A. R. Day, M. Hoyrup, I. Mezhirov, and A. Shen, \u201cA constructive version of Birkhoff\u2019s ergodic theorem for Martin-L\u00f6f random points,\u201d <i>Information and Computation<\/i>, vol. 210 (2012), pp. 21\u201330.","DOI":"10.1016\/j.ic.2011.10.006"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Brattka, V., J. S. Miller, and A. Nies, \u201cRandomness and differentiability,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 368 (2016), pp. 581\u2013605.","DOI":"10.1090\/tran\/6484"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Franklin, J. N. Y., N. Greenberg, J. S. Miller, and K. M. Ng, \u201cMartin-L\u00f6f random points satisfy Birkhoff\u2019s ergodic theorem for effectively closed sets,\u201d <i>Proceedings of the American Mathematical Society<\/i>, vol. 140 (2012), pp. 3623\u201328.","DOI":"10.1090\/S0002-9939-2012-11179-7"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Furstenberg, H., <i>Recurrence in Ergodic Theory and Combinatorial Number Theory<\/i>, Princeton University Press, Princeton, 1981.","DOI":"10.1515\/9781400855162"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] G\u00e1cs, P., M. Hoyrup, and C. Rojas, \u201cRandomness on computable probability spaces\u2014a dynamical point of view,\u201d <i>Theory of Computing Systems<\/i>, vol. 48 (2011), pp. 465\u201385.","DOI":"10.1007\/s00224-010-9263-x"},{"key":"7","unstructured":"[7] Graham, R. L., B. L. Rothschild, and J. H. Spencer, <i>Ramsey Theory<\/i>, 2nd edition, Wiley, New York, 1980."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Hochman, M., \u201cUpcrossing inequalities for stationary sequences and applications,\u201d <i>Annals of Probability<\/i>, vol. 37 (2009), pp. 2135\u201349.","DOI":"10.1214\/09-AOP460"},{"key":"9","unstructured":"[9] Hoyrup, M., \u201cThe dimension of ergodic random sequences,\u201d pp. 567\u201376 in <i>Theoretical Aspects of Computer Science<\/i>, edited by Christoph D\u00fcrr and Thomas Wilke, vol. 14 of <i>Leibniz International Proceedings in Informatics<\/i>, Schloss Dagstuhl, Wadern, 2012."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Ku\u010dera, A., \u201cMeasure, $\\Pi ^{0}_{1}$-classes and complete extensions of $\\mathrm{PA}$,\u201d pp. 245\u201359 in <i>Recursion Theory Week (Oberwolfach, 1984)<\/i>, edited by Heinz-Dieter Ebbinghaus, Gert H. M\u00fcller, and Gerald E. Sacks, vol. 1141 of <i>Lecture Notes in Mathematics<\/i>, Springer, Berlin, 1985.","DOI":"10.1007\/BFb0076224"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Li, M., and P. Vit\u00e1nyi, <i>An Introduction to Kolmogorov Complexity and Its Applications<\/i>, 2nd edition, Springer, New York, 1997.","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Turing, A. M., \u201cOn computable numbers, with an application to the Entscheidungsproblem,\u201d <i>Proceedings of the London Mathematical Society, Second Series<\/i>, vol. 42 (1936), pp. 230\u201365. Correction, <i>Proceedings of the London Mathematical Society, Second Series<\/i>, vol. 43 (1937), pp. 544\u201346.","DOI":"10.1112\/plms\/s2-42.1.230"},{"key":"15","unstructured":"[15] van Lambalgen, M., <i>Random Sequences<\/i>, Academish Proefschrift, Amsterdam, 1987."},{"key":"#cr-split#-16.1","doi-asserted-by":"crossref","unstructured":"[16] Vovk, V. G., \"The law of the iterated logarithm for sequences that are random in the sense of Kolmogorov or chaotic (in Russian),\" <i>Teoriya Veroyatnoste\u012d i ee Primeneniya<\/i>, vol. 32 (1987), pp. 456-68","DOI":"10.1137\/1132061"},{"key":"#cr-split#-16.2","unstructured":"English translation in <i>Theory of Probability and Its Applications<\/i>, vol. 32 (1987), pp. 413-25."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] V\u2019yugin, V. V., \u201cEffective convergence in probability and an ergodic theorem for individual random sequences (in Russian),\u201d <i>Teoriya Veroyatnoste\u012d i ee Primeneniya<\/i>, vol. 42 (1997), pp. 35\u201350; English translation in <i>Theory of Probability and Its Applications<\/i>, vol. 42 (1997), pp. 39\u201350.","DOI":"10.4213\/tvp1710"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2019-0017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:52Z","timestamp":1706648392000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-60\/issue-3\/Martin-L%c3%b6f-Randomness-Implies-Multiple-Recurrence-in-Effectively-Closed-Sets\/10.1215\/00294527-2019-0017.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,1]]},"references-count":18,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,8,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2019-0017","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8,1]]}}}