Author:
Ferbus-Zanda Marie,Grigorieff Serge
Reference53 articles.
1. Becher, V., Figueira, S., Nies, A., & Picchi, S. (2005). Program size complexity for possibly infinite computations. Notre Dame Journal of Formal Logic, 46(1), 51–64.
2. Becher, V., Figueira, S., Grigorieff, S., & Miller, J. (2006). Random reals and halting probabilities. The Journal of Symbolic Logic, 71(4), 1411–1430.
3. Bienvenu, L., & Merkle, W. (2007). Reconciling data compression and Kolmogorov complexity. In ICALP 2007, Wroclaw (LNCS, Vol. 4596, pp. 643–654).
4. Bienvenu, L., Merkle, W., & Shen, A. (2008). A simple proof of Miller-Yu theorem. Fundamenta Informaticae, 83(1–2), 21–24.
5. Bonfante, G., Kaczmarek, M., & Marion, J.-Y. (2006). On abstract computer virology: From a recursion-theoretic perspective. Journal in Computer Virology, 1(3–4), 45–54.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Theoretical Computer Science: Computational Complexity;A Guided Tour of Artificial Intelligence Research;2020