Subject
General Computer Science,Theoretical Computer Science
Reference6 articles.
1. Two recursively enumerable sets of incomparable degrees of unsolvability;Friedberg;Proc. Natl. Acad. Sci. USA,1957
2. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication;Friedberg;J. Symbolic Logic,1958
3. An alternative, priority-free, solution to Post's problem;Kucera,1986
4. Numberings of R1∪F;Kummer,1989
5. Theory of Recursive Functions and Effective Computability;Rogers,1967
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献