通有可计算性的极小对的不存在性
Nonexistence of Minimal Pairs for Generic Computability
摘要:
自然数的子集A的一般计算包括正确计算A的大多数位的计算,并且从不错误地计算A的任何位,但不一定对每个输入给出答案。这个概念的动机来自于群论和复杂性理论,但纯粹的递归理论分析被证明是有趣的,而且经常违反直觉。本文的主要结果是,有没有最小对一般的可计算性,回答了一个问题的Jockusch和Schupp。
英文摘要:
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for every input. The motivation for this concept comes from group theory and complexity theory, but the purely recursion theoretic analysis proves to be interesting, and often counterintuitive. The primary result of this paper is that there are no minimal pairs for generic computability, answering a question of Jockusch and Schupp.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。