Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Lecture Notes in Computer Science;L. Bienvenu,2010
2. Lecture Notes in Computer Science;C.E. Freer,2009
3. Gács, P.: Uniform test of algorithmic randomness over a general space. Theoretical Computer Science 341, 91–137 (2005)
4. Gács, P.: Lecture notes on descriptional complexity and randomness. Tech. rep., Boston University (2008)
5. Hertling, P., Weihrauch, K.: Random elements in effective topological spaces with measure. Information and Computation 181(1), 32–56 (2003)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献