加载中…
2006-02-20
Turing Incomparability in Scott Sets
Antonin KuceraTheodore A. Slaman
文献摘要
For every Scott set F and every nonrecursive set X in F, there is a Y in F such that X and Y are Turing incomparable.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本