Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. Information and Randomness. An Algorithmic Perspective;Calude,1994
2. Randomness everywhere;Calude;Nature,1999
3. Program-size complexity of initial segments and domination relation reducibility;Calude,1999
4. Kraft-Chaitin inequality revisited;Calude;J. Univ. Comput. Sci.,1996
5. C.S. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin Ω numbers, in: M. Morvan, C. Meinel, D. Krob (Eds.), Proc. 15th Symp. on Theoretical Aspects of Computer Science, Paris, Springer, Berlin, 1998, pp. 596–606. Theoret. Comput. Sci., Full paper to appear.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献