Funder
Agence Nationale de la Recherche
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference15 articles.
1. Barmpalias, G., Broadhead, P., Cenzer, D., Dashti, S., Weber, R.: Algorithmic randomness and closed sets. J. Logic Comput. 17(6), 1041–1062 (2007)
2. Bienvenu, L., Gács, P. , Hoyrup, M., Rojas, C., Shen, A.: Algorithmic tests and randomness with respect to a class of measures. Proc. Steklov Inst. Math. 274, 34–89 (2011). arXiv: 1103.1529
3. Bienvenu, L., Romashchenko, A., Shen, A.: Sparse sets, Journées Automates Cellulaires 2008 (Uzes), 18–28. hal.archives-ouvertes.fr/hal-00274010/en/hal.archives-ouvertes.fr/hal-00274010/en/
4. Diamondstone, D., Kjos-Hanssen, B.: Martin-Löf randomness and Galton–Watson processes. Ann. Pure Appl. Logic 163(5), 519–529 (2012). arXiv: 1408.2875
5. Hoyrup, M., Rojas, C.: An Application of Martin-Löf Randomness to Effective Probability Theory, Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24. Proceedings (Lecture Notes in Computer Science, v. 5635), pp. 260-269 (2009)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献