{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T06:09:00Z","timestamp":1772604540649,"version":"3.50.1"},"reference-count":28,"publisher":"Duke University Press","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2009,10,1]]},"DOI":"10.1215\/00294527-2009-017","type":"journal-article","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T14:39:11Z","timestamp":1265899151000},"source":"Crossref","is-referenced-by-count":25,"title":["The K-Degrees, Low for K Degrees,and Weakly Low for K Sets"],"prefix":"10.1215","volume":"50","author":[{"given":"Joseph S.","family":"Miller","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Calude, C. S., P. H. Hertling, B. Khoussainov, and Y. Wang, \"Recursively enumerable reals and Chaitin $\\Omega$ numbers\", pp. 596--606 in <i>STACS<\/i> 98 (Paris, 1998), edited by M. Morvan, C. Meinel, and D. Krob, vol. 1373 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 1998.","DOI":"10.1007\/BFb0028594"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Chaitin, G. J., \"Incompleteness theorems for random reals\", <i>Advances in Applied Mathematics<\/i>, vol. 8 (1987), pp. 119--46.","DOI":"10.1016\/0196-8858(87)90010-8"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Downey, R. G., D. R. Hirschfeldt, and G. LaForte, \"Randomness and reducibility\", pp. 316--27 in <i>Mathematical Foundations of Computer Science, 2001 (Mari\u00e1nsk\u00e9 L\u00e1zn\\u e)<\/i>, edited by J. Sgall, A. Pultr, and P. Kolman, vol. 2136 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 2001.","DOI":"10.1007\/3-540-44683-4_28"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Downey, R. G., D. R. Hirschfeldt, and G. LaForte, \"Randomness and reducibility\", <i>Journal of Computer and System Sciences<\/i>, vol. 68 (2004), pp. 96--114.","DOI":"10.1016\/j.jcss.2003.07.004"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Downey, R. G., D. R. Hirschfeldt, J. S. Miller, and A. Nies, \"Relativizing Chaitin's halting probability\", <i>Journal of Mathematical Logic<\/i>, vol. 5 (2005), pp. 167--92.","DOI":"10.1142\/S0219061305000468"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Hirschfeldt, D. R., A. Nies, and F. Stephan, \"Using random sets as oracles\", <i>Journal of the London Mathematical Society. Second Series<\/i>, vol. 75 (2007), pp. 610--22.","DOI":"10.1112\/jlms\/jdm041"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Ku\u010dera, A., and T. A. Slaman, \"Randomness and recursive enumerability\", <i>SIAM<\/i> Journal on Computing, vol. 31 (2001), pp. 199--211.","DOI":"10.1137\/S0097539799357441"},{"key":"14","unstructured":"[14] Li, M., and P. Vit\u00e1nyi, <i>An Introduction to Kolmogorov Complexity and Its Applications<\/i>, Texts and Monographs in Computer Science. Springer-Verlag, New York, 1993."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] Martin-L\u00f6f, P., \"Complexity oscillations in infinite binary sequences\", <i>Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete<\/i>, vol. 19 (1971), pp. 225--30.","DOI":"10.1007\/BF00534110"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] Miller, J. S., \"Every 2-random real is Kolmogorov random\", <i>The Journal of Symbolic Logic<\/i>, vol. 69 (2004), pp. 907--13.","DOI":"10.2178\/jsl\/1096901774"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Miller, J. S., and A. Nies, \"Randomness and computability: Open questions\", <i>The Bulletin of Symbolic Logic<\/i>, vol. 12 (2006), pp. 390--410.","DOI":"10.2178\/bsl\/1154698740"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] Miller, J. S., and L. Yu, \"On initial segment complexity and degrees of randomness\", <i>Transactions of the American Mathematical Society<\/i>, vol. 360 (2008), pp. 3193--3210.","DOI":"10.1090\/S0002-9947-08-04395-X"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] Nies, A., <i>Computability and Randomness<\/i>, Oxford Logic Guides. Oxford University Press, Oxford, 2009.","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] Nies, A., \"Lowness properties and randomness\", <i>Advances in Mathematics<\/i>, vol. 197 (2005), pp. 274--305.","DOI":"10.1016\/j.aim.2004.10.006"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] Schnorr, C. P., \"A unified approach to the definition of random sequences\", <i>Mathematical Systems Theory<\/i>, vol. 5 (1971), pp. 246--58.","DOI":"10.1007\/BF01694181"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] Soare, R. I., <i>Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets<\/i>, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] van Lambalgen, M., \"The axiomatization of randomness\", <i>The Journal of Symbolic Logic<\/i>, vol. 55 (1990), pp. 1143--67.","DOI":"10.2307\/2274480"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] Yu, L., D. Ding, and R. G. Downey, \"The Kolmogorov complexity of random reals\", <i>Annals of Pure and Applied Logic<\/i>, vol. 129 (2004), pp. 163--80.","DOI":"10.1016\/j.apal.2004.01.006"},{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Barmpalias, G., \"Relative randomness and cardinality\", forthcoming in <i>Notre Dame Journal of Formal Logic<\/i>, 2010.","DOI":"10.1215\/00294527-2010-012"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Barmpalias, G., A. E. M. Lewis, and M. Soskova, \"Randomness, lowness and degrees\", <i>The Journal of Symbolic Logic<\/i>, vol. 73 (2008), pp. 559--77.","DOI":"10.2178\/jsl\/1208359060"},{"key":"3","unstructured":"[3] Bienvenu, L., and R. G. Downey, \"Kolmogorov complexity and Solovay functions\", pp. 147--58 in <i>26th Annual Symposium on Theoretical Aspects of Computer Science (STACS<\/i> 2009), vol. 3 of Leibniz International Proceedings in Informatics, edited by S. Albers and J.-Y. Marion, Dagstuhl, Germany, 2009. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany."},{"key":"6","unstructured":"[6] Downey, R., and D. Hirschfeldt, <i>Algorithmic Randomness and Complexity<\/i>, Springer-Verlag, Berlin. forthcoming."},{"key":"11","unstructured":"[11] Kautz, S., <i>Degrees of Random Sets<\/i>, Ph.D. thesis, Cornell University, Ithaca, 1991."},{"key":"12","unstructured":"[12] Kjos-Hanssen, B., J. S. Miller, and R. Solomon, \"Lowness notions, measure, and domination\", in preparation."},{"key":"18","unstructured":"[18] Miller, J. S., and L. Yu, \"Oscillation in the initial segment complexity of random reals\", forthcoming."},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] Nies, A., F. Stephan, and S. A. Terwijn, \"Randomness, relativization and Turing degrees\", <i>The Journal of Symbolic Logic<\/i>, vol. 70 (2005), pp. 515--35.","DOI":"10.2178\/jsl\/1120224726"},{"key":"23","unstructured":"[23] Reimann, J., and T. A. Slaman, \"Measures and their random reals\", forthcoming."},{"key":"26","unstructured":"[26] Solovay, R. M., \"Draft of paper (or series of papers) on Chaitin's work\", (1975). unpublished notes, 215 pages."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2009-017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:20Z","timestamp":1706648240000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-50\/issue-4\/The-K-Degrees-Low-for-K-Degreesand-Weakly-Low-for\/10.1215\/00294527-2009-017.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,1]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2009,10,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2009-017","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2009,10,1]]}}}