AbstractWe employ techniques related to Lempp and Lerman's “iterated trees of strategies” to directly measure a Σ5-predicate and use this in showing the index set of the cuppable r.e. sets to be Σ5-complete. We also show how certain technical devices arise naturally out of the iterated-trees context, in particular, links arise as manifestations of a generalized notion of “stage”
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
We prove that every set of partial recursive functions which can be identified by an inductive infer...
AbstractWe show the following results regarding complete sets.•NP-complete sets and PSPACE-complete ...
AbstractWe employ techniques related to Lempp and Lerman's “iterated trees of strategies” to directl...
AbstractWe extend the techniques of Jahn (1996) to show the index set of the major subsets to be ∑5-...
Abstract. We investigate the truth-table degrees of (co-)c.e. sets, in partic-ular, sets of random s...
This paper studies the Turing degrees of various properties defined for universal numberings, that i...
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular,sets of random strings. It ...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
AbstractIf I is a set of Δ02 low sets which is closed under recursive join and downward closed under...
AbstractWe prove the following results: every recursively enumerable set approximated by finite sets...
Rabin conditions are a general class of properties of infinite sequences that encompass most known a...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
We prove that every set of partial recursive functions which can be identified by an inductive infer...
AbstractWe show the following results regarding complete sets.•NP-complete sets and PSPACE-complete ...
AbstractWe employ techniques related to Lempp and Lerman's “iterated trees of strategies” to directl...
AbstractWe extend the techniques of Jahn (1996) to show the index set of the major subsets to be ∑5-...
Abstract. We investigate the truth-table degrees of (co-)c.e. sets, in partic-ular, sets of random s...
This paper studies the Turing degrees of various properties defined for universal numberings, that i...
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular,sets of random strings. It ...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
AbstractIf I is a set of Δ02 low sets which is closed under recursive join and downward closed under...
AbstractWe prove the following results: every recursively enumerable set approximated by finite sets...
Rabin conditions are a general class of properties of infinite sequences that encompass most known a...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
We prove that every set of partial recursive functions which can be identified by an inductive infer...
AbstractWe show the following results regarding complete sets.•NP-complete sets and PSPACE-complete ...
DOI
Add to ORKG