{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:36Z","timestamp":1740109416667,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T00:00:00Z","timestamp":1504137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T00:00:00Z","timestamp":1504137600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1247051","1545028"],"award-info":[{"award-number":["1247051","1545028"]}],"id":[{"id":"10.13039\/100000001","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-9804-7","type":"journal-article","created":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T05:52:21Z","timestamp":1504158741000},"page":"1586-1598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounded Turing Reductions and Data Processing Inequalities for Sequences"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8031-7184","authenticated-orcid":false,"given":"Adam","family":"Case","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,31]]},"reference":[{"key":"9804_CR1","volume-title":"Strongly Bounded Turing Reducibilities and Computably Enumerable Sets","author":"K Ambos-Spies","year":"2011","unstructured":"Ambos-Spies, K.: Strongly Bounded Turing Reducibilities and Computably Enumerable Sets. Heidelberg University Lecture Notes, Heidelberg (2011)"},{"issue":"2","key":"9804_CR2","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1214\/aoms\/1177704583","volume":"33","author":"CB Bell","year":"1962","unstructured":"Bell, C.B.: Mutual information and maximal correlation as measures of dependence. Ann. Math. Stat. 33(2), 587\u2013595 (1962)","journal-title":"Ann. Math. Stat."},{"key":"9804_CR3","doi-asserted-by":"crossref","unstructured":"Case, A., Lutz, J.H.: Mutual dimension. ACM Trans. Comput. Theory 7: article no. 12. Part of the Lecture Notes in Computer Science, book series (LNCS, vol. 9235) (2015)","DOI":"10.1145\/2786566"},{"key":"9804_CR4","doi-asserted-by":"crossref","unstructured":"Case, A., Lutz, J.H.: Mutual dimension and random sequences. In: Proceedings of the 40th International Symposium on the Mathematical Foundations of Computer Science, pp. 199\u2013210. Springer (2015)","DOI":"10.1007\/978-3-662-48054-0_17"},{"key":"9804_CR5","volume-title":"Elements of information theory","author":"TR Cover","year":"2006","unstructured":"Cover, T.R., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Hoboken (2006)","edition":"2"},{"key":"9804_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jcss.2003.07.004","volume":"68","author":"RG Downey","year":"2004","unstructured":"Downey, R.G., Hirschfeldt, D.R., LaForte, G.: Randomness and reducibility. J. Comput. Syst. Sci. 68, 96\u2013114 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"9804_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(86)80004-3","volume":"70","author":"P G\u00e1cs","year":"1986","unstructured":"G\u00e1cs, P.: Every sequence is reducible to a random one. Inf. Control 70, 186\u2013192 (1986)","journal-title":"Inf. Control"},{"issue":"1","key":"9804_CR8","first-page":"1","volume":"1","author":"AN Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Inf. Transm. 1(1), 1\u20137 (1965)","journal-title":"Probl. Inf. Transm."},{"issue":"3","key":"9804_CR9","first-page":"30","volume":"10","author":"LA Levin","year":"1974","unstructured":"Levin, L.A.: Laws of information conservation (nongrowth) and aspects of the foundation of probability theory. Probl. Peredachi Informatsii 10(3), 30\u201335 (1974)","journal-title":"Probl. Peredachi Informatsii"},{"key":"9804_CR10","volume-title":"A concept of independence with applications in various fields of mathematics","author":"LA Levin","year":"1980","unstructured":"Levin, L.A.: A concept of independence with applications in various fields of mathematics. Technical report, Massachusetts Institute of Technology, Massachusetts (1980)"},{"issue":"1","key":"9804_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0019-9958(84)80060-1","volume":"61","author":"LA Levin","year":"1984","unstructured":"Levin, L.A.: Randomness conservation inequalities; information and independence in mathematical theories. Inf. Control 61(1), 15\u201337 (1984)","journal-title":"Inf. Control"},{"key":"9804_CR12","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1017\/S0960129506005445","volume":"16","author":"AEM Lewis","year":"2006","unstructured":"Lewis, A.E.M., Barmpalias, G.: Random reals and Lipschitz continuity. Math. Struct. Comput. Sci. 16, 737\u2013749 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9804_CR13","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.apal.2006.08.001","volume":"145","author":"AEM Lewis","year":"2006","unstructured":"Lewis, A.E.M., Barmpalias, G.: Randomness and the linear degrees of computability. Ann. Pure Appl. Log. 145, 252\u2013257 (2006)","journal-title":"Ann. Pure Appl. Log."},{"key":"9804_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"Introduction to Kolmogorov Complexity and its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and its Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"issue":"1","key":"9804_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"JH Lutz","year":"2003","unstructured":"Lutz, J.H.: The dimensions of individual strings and sequences. Inf. Comput. 187(1), 49\u201379 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"9804_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(02)00343-5","volume":"84","author":"E Mayordomo","year":"2002","unstructured":"Mayordomo, E.: A Kolmogorov complexity characterization of constructive Hausdorff dimension. Inf. Process. Lett. 84(1), 1\u20133 (2002)","journal-title":"Inf. Process. Lett."},{"key":"9804_CR17","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1987","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)"},{"key":"9804_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively enumerable sets and degrees: a study of computable functions and computably generated sets","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees: a study of computable functions and computably generated sets. Springer-Verlag, Berlin (1987)"},{"key":"9804_CR19","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.apal.2009.01.008","volume":"160","author":"RI Soare","year":"2009","unstructured":"Soare, R.I.: Turing oracle machines, online computing, and three displacements in computability theory. Ann. Pure Appl. Log. 160, 368\u2013399 (2009)","journal-title":"Ann. Pure Appl. Log."},{"key":"9804_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: an Introduction","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis: an Introduction. Springer, Berlin (2000)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9804-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9804-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9804-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T05:38:19Z","timestamp":1589693899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9804-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,31]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9804"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9804-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2017,8,31]]},"assertion":[{"value":"31 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}