1. Bauwens, B.: Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. PhD thesis, Ugent (May 2010)
2. Bienvenu, L., Shen, A.: Algorithmic information theory and martingales. arXiv:0906.2614v1 (2009) (preprint)
3. Epstein, S., Levin, L.A.: Sets Have Simple Members. arXiv:1107.1458v5 (2011) (preprint)
4. Friedberg, R.: Three theorems on recursive numberings. J. of Symbolic Logic 23, 309–316 (1958)
5. Muchnik, A.A.: On the basic structures of the descriptive theory of algorithms. Soviet Math. Dokl. 32, 671–674 (1985)