19 research outputs found
Relatively computably enumerable reals
A real X is defined to be relatively c.e. if there is a real Y such that X is
c.e.(Y) and Y does not compute X. A real X is relatively simple and above if
there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset
Z of the complement of X such that Z is c.e.(Y). We prove that every nonempty
Pi^0_1 class contains a member which is not relatively c.e. and that every
1-generic real is relatively simple and above.Comment: 5 pages. Significant changes from earlier versio
Iterated relative recursive enumerability
A result of Soare and Stob asserts that for any non-recursive r.e. set C , there exists a r.e.[ C ] set A such that A ⊕ C is not of r.e. degree. A set Y is called [of] m -REA ( m -REA[ C ] [degree] iff it is [Turing equivalent to] the result of applying m -many iterated ‘hops’ to the empty set (to C ), where a hop is any function of the form X → X ⊕ W e X . The cited result is the special case m =0, n =1 of our Theorem. For m =0,1, and any ( m +1)-REA set C , if C is not of m -REA degree, then for all n there exists a n -r.e.[ C ] set A such that A ⊕ C is not of ( m+n )-REA degree. We conjecture that this holds also for m ≥2.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46068/1/153_2005_Article_BF01278463.pd
A polychromatic Ramsey theory for ordinals
The Ramsey degree of an ordinal α is the least number n such that any colouring of the edges of the complete graph on α using finitely many colours contains an n-chromatic clique of order type α. The Ramsey degree exists for any ordinal α < ω ω . We provide an explicit expression for computing the Ramsey degree given α. We further establish a version of this result for automatic structures. In this version the ordinal and the colouring are presentable by finite automata and the clique is additionally required to be regular. The corresponding automatic Ramsey degree turns out to be greater than the set theoretic Ramsey degree. Finally, we demonstrate that a version for computable structures fails
Partial Recursive Functions and Finality
Abstract. We seek universal categorical conditions ensuring the representability of all partial recursive functions. In the category Pfn of sets and partial functions, the natural numbers provide both an initial algebra and a final coalgebra for the functor 1 + −. We recount how finality yields closure of the partial functions on natural numbers under Kleene’s µ-recursion scheme. Noting that Pfn is not cartesian, we then build on work of Paré and Román, obtaining weak initiality and finality conditions on natural numbers algebras in monoidal categories that ensure the (weak) representability of all partial recursive functions. We further obtain some positive results on strong representability. All these results adapt to Kleisli categories of cartesian categories with natural numbers algebras. However, in general, not all partial recursive functions need be strongly representable.
A join theorem for the computably enumerable degrees
10.1090/S0002-9947-04-03585-8Transactions of the American Mathematical Society35672557-256
The jump classes of minimal covers
We work in D[<0′] . Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high 2. We show that there exists a c.e. degree which is high 2 with no high 1 minimal cover