P. Gács, Uniform test of algorithmic randomness over a general space, Theoretical Computer Science, vol.341, issue.1-3, pp.91-137, 2005.
DOI : 10.1016/j.tcs.2005.03.054

M. Li and P. Vitányi, An introduction to Kolmogorov complexity and its applications. Texts in Computer Science, 2008.

P. Vitanyi and N. Chater, Algorithmic identification of probabilities, 2013.

K. Weihrauch, Computable analysis, 2000.
DOI : 10.1007/978-3-642-56999-9

T. Zeugmann and S. Zilles, Learning recursive functions: A survey, Theoretical Computer Science, vol.397, issue.1-3, pp.4-56, 2008.
DOI : 10.1016/j.tcs.2008.02.021