{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:43Z","timestamp":1740109423757,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,3,9]],"date-time":"2017-03-09T00:00:00Z","timestamp":1489017600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,3,9]],"date-time":"2017-03-09T00:00:00Z","timestamp":1489017600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["26870143"],"award-info":[{"award-number":["26870143"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00224-017-9752-2","type":"journal-article","created":{"date-parts":[[2017,3,9]],"date-time":"2017-03-09T02:00:35Z","timestamp":1489024835000},"page":"1599-1619","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coherence of Reducibilities with Randomness Notions"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5346-4269","authenticated-orcid":false,"given":"Kenshi","family":"Miyabe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,9]]},"reference":[{"issue":"3","key":"9752_CR1","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1017\/S1079898600010672","volume":"19","author":"G Barmpalias","year":"2013","unstructured":"Barmpalias, G.: Algorithmic randomness and measures of complexity. Bull. Symb. Log. 19(3), 318\u2013350 (2013)","journal-title":"Bull. Symb. Log."},{"issue":"5","key":"9752_CR2","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00153-015-0430-2","volume":"54","author":"B Bauwens","year":"2015","unstructured":"Bauwens, B.: Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. Arch. Math. Log. 54(5), 615\u2013629 (2015)","journal-title":"Arch. Math. Log."},{"key":"9752_CR3","unstructured":"Bienvenu, L.: Game-Theoretic Approaches to Randomness: Unpredictability and Stochasticity. PhD thesis, Universit\u00e9 de Provence - Aix-Marseille I (2009)"},{"key":"9752_CR4","unstructured":"Bienvenu, L., Downey, R.: Kolmogorov Complexity and Solovay Functions. In: STACS, volume 3 of LIPIcs, pp 147\u2013158 (2009)"},{"issue":"8","key":"9752_CR5","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1016\/j.jcss.2015.04.004","volume":"81","author":"L Bienvenu","year":"2015","unstructured":"Bienvenu, L., Downey, R., Nies, A., Merkle, W.: Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. 81(8), 1575\u20131591 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"9752_CR6","first-page":"643","volume-title":"Automata, Languages and Programming, volume 4596 of Lecture Notes in Computer Science","author":"L Bienvenu","year":"2007","unstructured":"Bienvenu, L., Merkle, W.: Reconciling data compression and Kolmogorov complexity. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) Automata, Languages and Programming, volume 4596 of Lecture Notes in Computer Science, pp 643\u2013654. Springer, Berlin (2007)"},{"issue":"3","key":"9752_CR7","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/s00224-009-9203-9","volume":"47","author":"L Bienvenu","year":"2010","unstructured":"Bienvenu, L., Muchnik, A., Shen, A., Vereshchagin, N.: Limit complexities revisited. Theor. Comput. Syst. 47(3), 720\u2013736 (2010)","journal-title":"Theor. Comput. Syst."},{"key":"9752_CR8","unstructured":"Bienvenu, L., Muchnik, A., Shen, A., Vereshchagin, N.: Limit complexities revisited [once more]. ArXiv e-prints (2012)"},{"key":"9752_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2012.01.011","volume":"438","author":"CJ Conidis","year":"2012","unstructured":"Conidis, C.J.: Effectively approximating measurable sets by open sets. Theor. Comput. Sci. 438, 36\u201346 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9752_CR10","doi-asserted-by":"publisher","first-page":"533","DOI":"10.2178\/jsl\/1082418542","volume":"69","author":"R Downey","year":"2004","unstructured":"Downey, R., Griffiths, E.: Schnorr randomness. J. Symb. Log. 69(2), 533\u2013554 (2004)","journal-title":"J. Symb. Log."},{"key":"9752_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic randomness and complexity","author":"R Downey","year":"2010","unstructured":"Downey, R., Hirschfeldt, D.R.: Algorithmic randomness and complexity. Springer, Berlin (2010)"},{"key":"9752_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2004.03.055","volume":"321","author":"RG Downey","year":"2004","unstructured":"Downey, R.G., Griffiths, E.J., Reid, S.: On Kurtz randomness. Theor. Comput. Sci. 321, 249\u2013270 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9752_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.2178\/jsl\/1264433915","volume":"75","author":"JNY Franklin","year":"2010","unstructured":"Franklin, J.N.Y.: Schnorr triviality and genericity. J. Symb. Log. 75(1), 191\u2013207 (2010)","journal-title":"J. Symb. Log."},{"issue":"2","key":"9752_CR14","doi-asserted-by":"publisher","first-page":"501","DOI":"10.2178\/jsl\/1268917492","volume":"75","author":"JNY Franklin","year":"2010","unstructured":"Franklin, J.N.Y., Stephan, F.: Schnorr trivial sets and truth-table reducibility. J. Symb. Log. 75(2), 501\u2013521 (2010)","journal-title":"J. Symb. Log."},{"key":"9752_CR15","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications. Graduate texts in computer science","author":"M Li","year":"2009","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Graduate texts in computer science, third edition. Springer, New York (2009)","edition":"third edition"},{"issue":"3","key":"9752_CR16","doi-asserted-by":"publisher","first-page":"907","DOI":"10.2178\/jsl\/1096901774","volume":"69","author":"JS Miller","year":"2004","unstructured":"Miller, J.S.: Every 2-random real is Kolmogorov random. J. Symb. Log. 69(3), 907\u2013913 (2004)","journal-title":"J. Symb. Log."},{"key":"9752_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1215\/00294527-2009-017","volume":"50","author":"JS Miller","year":"2010","unstructured":"Miller, J.S.: The K-degrees, low for K-degrees, and weakly low for K sets. Notre Dame J. Formal Log. 50, 381\u2013391 (2010)","journal-title":"Notre Dame J. Formal Log."},{"key":"9752_CR18","doi-asserted-by":"publisher","first-page":"3193","DOI":"10.1090\/S0002-9947-08-04395-X","volume":"360","author":"JS Miller","year":"2008","unstructured":"Miller, J.S., Yu, L.: On initial segment complexity and degrees of randomness. Trans. Am. Math. Soc. 360, 3193\u20133210 (2008)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"9752_CR19","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00224-013-9506-8","volume":"56","author":"K Miyabe","year":"2015","unstructured":"Miyabe, K.: Schnorr triviality and its equivalent notions. Theor. Comput. Syst. 56(3), 465\u2013486 (2015)","journal-title":"Theor. Comput. Syst."},{"issue":"3","key":"9752_CR20","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00224-014-9583-3","volume":"58","author":"K Miyabe","year":"2016","unstructured":"Miyabe, K.: Reducibilities relating to schnorr randomness. Theory Comput. Syst. 58(3), 441\u2013462 (2016)","journal-title":"Theory Comput. Syst."},{"key":"9752_CR21","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and Randomness","author":"A Nies","year":"2009","unstructured":"Nies, A.: Computability and Randomness. Oxford University Press, USA (2009)"},{"key":"9752_CR22","doi-asserted-by":"publisher","first-page":"515","DOI":"10.2178\/jsl\/1120224726","volume":"70","author":"A Nies","year":"2005","unstructured":"Nies, A., Stephan, F., Terwijn, S.: Randomness, relativization and Turing degrees. J. Symb. Log. 70, 515\u2013535 (2005)","journal-title":"J. Symb. Log."},{"key":"9752_CR23","unstructured":"van Lambalgen, M.: Random Sequences. PhD Thesis University of Amsterdam (1987)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9752-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9752-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9752-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T05:38:24Z","timestamp":1589693904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9752-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,9]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9752"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9752-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2017,3,9]]},"assertion":[{"value":"9 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}