Equivalences between learning of data and probability distributions, and their applications

Adleman, 1991, Inductive inference and unsolvability, J. Symb. Log., 56, 891, 10.2307/2275058 Ambainis, 2001, Probabilistic inductive inference: a survey, Theor. Comput. Sci., 264, 155, 10.1016/S0304-3975(00)00218-8 Bienvenu, 2012, Von Neumann's biased coin revisited, 145, 10.1109/LICS.2012.26 Bienvenu, 2014, Algorithmic identification of probabilities is hard, 85 Bienvenu, 2018, Algorithmic identification of probabilities is hard, J. Comput. Syst. Sci., 95, 98, 10.1016/j.jcss.2018.01.002 Blum, 1975, Toward a mathematical theory of inductive inference, Inf. Control, 28, 125, 10.1016/S0019-9958(75)90261-2 Day, 2013, Randomness for non-computable measures, Trans. Am. Math. Soc., 365, 3575, 10.1090/S0002-9947-2013-05682-6 Downey, 2010 Fortnow, 1994, Extremes in the degrees of inferability, Ann. Pure Appl. Log., 66, 231, 10.1016/0168-0072(94)90035-3 Gács, 2005, Uniform test of algorithmic randomness over a general space, Theor. Comput. Sci., 341, 91, 10.1016/j.tcs.2005.03.054 Gasarch, 1989, Learning via queries to an oracle, 214 Gold, 1967, Language identification in the limit, Inf. Control, 10, 447, 10.1016/S0019-9958(67)91165-5 Jockusch, 1972, Degrees in which the recursive sets are uniformly recursive, Can. J. Math., 24, 1092, 10.4153/CJM-1972-113-9 Juedes, 1995, Weak completeness in e1 and e2, Theor. Comput. Sci., 143, 149, 10.1016/0304-3975(95)80030-D Kearns, 1994, On the learnability of discrete distributions, 273 Kummer, 1996, On the structure of degrees of inferability, J. Comput. Syst. Sci., 52, 214, 10.1006/jcss.1996.0018 Levin, 1976, Uniform tests for randomness, Dokl. Akad. Nauk SSSR, 227, 33 Levin, 1984, Randomness conservation inequalities; information and independence in mathematical theories, Inf. Control, 61, 15, 10.1016/S0019-9958(84)80060-1 Li, 1997, An Introduction to Kolmogorov Complexity and Its Applications Martin-Löf, 1966, The definition of random sequences, Inf. Control, 9, 602, 10.1016/S0019-9958(66)80018-9 Odifreddi, 1999 Osherson, 1986 Pinker, 1979, Formal models of language learning, Cognition, 7, 217, 10.1016/0010-0277(79)90001-5 Pitt, 1989, Probabilistic inductive inference, J. ACM, 36, 383, 10.1145/62044.62053 Reimann, 2015, Measures and their random reals, Trans. Am. Math. Soc., 367, 5081, 10.1090/S0002-9947-2015-06184-4 Slaman, 1991, When oracles do not help, 379 Vapnik, 1982, Estimation of Dependences Based on Empirical Data Vitányi, 2017, Identification of probabilities, J. Math. Psychol., Part A, 76, 13, 10.1016/j.jmp.2016.11.004 Weihrauch, 1993, Computability on computable metric spaces, Theor. Comput. Sci., 113, 191, 10.1016/0304-3975(93)90001-A