We examine the degree spectra of relations on . Given an additional relation on , such as the successor relation, the degree spectrum of is the set of Turing degrees of in computable copies of . It is known that all degree spectra of relations on fall into one of four categories: the computable degree, all of the c.e. degrees, all of the degrees, or intermediate between the c.e. degrees and the degrees. Examples of the first three degree spectra are easy to construct and well-known, but until recently it was open whether there is a relation with intermediate degree spectrum on a cone. Bazhenov, Kalociński, and Wroclawski constructed an example of an intermediate degree spectrum, but their example is unnatural in the sense that it is constructed by diagonalization and thus not canonical, that is, which relation you obtain from their construction depends on which Gödel encoding (and hence order of enumeration) of the partial computable functions / programs you choose. In this paper, we use the ‘‘on-a-cone’’ paradigm to restrict our attention to “natural” relations . Our main result is a construction of a natural relation on which has intermediate degree spectrum. This relation has intermediate degree spectrum because of structural reasons.

生成讲解博客的中文版本

生成AI智能校验的中文版本