Reference75 articles.
1. K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Effective strong di-mension in algorithmic information and computational complexity. SIAM Journal on Computing. To appear.
2. C. Bourke, J. M. Hitchcock, and N. V. Vinodchandran. Entropy rates and finite-state dimension. Theoretical Computer Science, 349:392-406, 2005.
3. J. Cai and J. Hartmanis. On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. Journal of Computer and Systems Sciences, 49:605-619, 1994.
4. C. S. Calude, L. Staiger, and S. A. Terwijn. On partial randomness. Annals of Pure and Applied Logic, 138:20-30, 2006.
5. W. S., Cassels. On a problem of Steinhaus about normal numbers. Colloquium Mathematicum, 7:95-101, 1959.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献