Author:
Stephan Frank,Teutsch Jason
Reference18 articles.
1. [1] Arslanov, M. M., "Some generalizations of a fixed-point theorem", Izvestiya Vysshikh Uchebnykh Zavedeniĭ. Matematika, (1981), pp. 9--16.
2. [2] Blum, M., "On the size of machines", Information and Computation, vol. 11 (1967), pp. 257--65.
3. [3] Herrmann, E., "$1$"-reducibility inside an $\rm m$"-degree with a maximal set, The Journal of Symbolic Logic, vol. 57 (1992), pp. 1046--56.
4. [4] Jockusch, C. G., Jr., M. Lerman, R. I. Soare, and R. M. Solovay, "Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion", The Journal of Symbolic Logic, vol. 54 (1989), pp. 1288--323.
5. [5] Kummer, M., "On the complexity of random strings (extended abstract)", pp. 25--36 in STACS 96 (Grenoble, 1996), vol. 1046 of Lecture Notes in Computer Science, Springer, Berlin, 1996.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bi-immunity over different size alphabets;Theoretical Computer Science;2021-11
2. Searching for shortest and least programs;Theoretical Computer Science;2020-02
3. A Brief on Short Descriptions;ACM SIGACT News;2016-03-10
4. On Approximate Decidability of Minimal Programs;ACM Transactions on Computation Theory;2015-09-11
5. An incomplete set of shortest descriptions;The Journal of Symbolic Logic;2012-03