Results 1  10
of
12
On the strength of Ramsey’s Theorem for pairs
 Journal of Symbolic Logic
, 2001
"... Abstract. We study the proof–theoretic strength and effective content denote Ramof the infinite form of Ramsey’s theorem for pairs. Let RT n k sey’s theorem for k–colorings of n–element sets, and let RT n < ∞ denote (∀k)RTn k. Our main result on computability is: For any n ≥ 2 and any computable (r ..."
Abstract

Cited by 41 (9 self)
 Add to MetaCart
Abstract. We study the proof–theoretic strength and effective content denote Ramof the infinite form of Ramsey’s theorem for pairs. Let RT n k sey’s theorem for k–colorings of n–element sets, and let RT n < ∞ denote (∀k)RTn k. Our main result on computability is: For any n ≥ 2 and any computable (recursive) k–coloring of the n–element sets of natural numbers, there is an infinite homogeneous set X with X ′ ′ ≤T 0 (n). Let I�n and B�n denote the �n induction and bounding schemes, respectively. Adapting the case n = 2 of the above result (where X is low2) to models is conservative of arithmetic enables us to show that RCA0 + I �2 + RT2 2 over RCA0 + I �2 for �1 1 statements and that RCA0 + I �3 + RT2 < ∞ is �1 1conservative over RCA0 + I �3. It follows that RCA0 + RT2 2 does not imply B �3. In contrast, J. Hirst showed that RCA0 + RT2 < ∞ does imply B �3, and we include a proof of a slightly strengthened version of this result. It follows that RT2 < ∞ is strictly stronger than RT2 2 over RC A0. 1.
Randomness, lowness and degrees
 J. of Symbolic Logic
, 2006
"... Abstract. We say that A ≤LR B if every Brandom number is Arandom. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on γ. In other words, B is at least as good as A for this purpose. We study the structure of the LR degrees globally a ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Abstract. We say that A ≤LR B if every Brandom number is Arandom. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on γ. In other words, B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e. restricted to the computably enumerable degrees) and their relationship with the Turing degrees. Among other results we show that whenever α is not GL2 the LR degree of α bounds 2 ℵ0 degrees (so that, in particular, there exist LR degrees with uncountably many predecessors) and we give sample results which demonstrate how various techniques from the theory of the c.e. degrees can be used to prove results about the c.e. LR degrees. 1.
On the Query Complexity of Sets
, 1996
"... . There has been much research over the last eleven years that considers the number of queries needed to compute a function as a measure of its complexity. We are interested in the complexity of certain sets in this context. We study the sets ODD A n = f(x1 ; : : : ; xn) : jA " fx1 ; : : : ; xn gj ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
. There has been much research over the last eleven years that considers the number of queries needed to compute a function as a measure of its complexity. We are interested in the complexity of certain sets in this context. We study the sets ODD A n = f(x1 ; : : : ; xn) : jA " fx1 ; : : : ; xn gj is oddg and WMOD(m) A n = f(x1 ; : : : ; xn) : jA " fx1 ; : : : ; xn gj 6j 0 (mod m)g. If A = K or A is semirecursive, we obtain tight bounds on the query complexity of ODD A n and WMOD(m) A n . We obtain lower bounds for A r.e. The lower bounds for A r.e. are derived from the lower bounds for A semirecursive. We obtain that every ttdegree has a set A such that ODD A n requires n parallel queries to A, and a set B such that ODD B n can be decided with one query to B. Hence for boundedquery complexity, how information is packaged is more important than Turing degree. We investigate when extra queries add power. We show that, for several nonrecursive sets A, the more queries you can...
Model Theory of the Computably Enumerable ManyOne Degrees
"... We investigate model theoretic properties of Rm , the partial order of computably enumerable manyone degrees. We prove that all nontrivial final segments and the set of minimal degrees are automorphism bases, and that some proper half open initial segment is an elementary substructure of Rm \Gamma f ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We investigate model theoretic properties of Rm , the partial order of computably enumerable manyone degrees. We prove that all nontrivial final segments and the set of minimal degrees are automorphism bases, and that some proper half open initial segment is an elementary substructure of Rm \Gamma f1g. This shows that Rm is not a minimal model. In an appendix, we show that the manyone degree of an rmaximal set is join irreducible. Keywords: Model theory, manyone degrees This article is dedicated to Mari Santos. 1 Introduction Manyone reducibility, introduced by Post [9], is a rather fine way to measure the relative complexity of subsets of !: X is manyone reducible to Y , written X m Y , if X = f \Gamma1 (Y ) for a computable function f (we assume that f can also assume the values TRUE and FALSE to avoid trivialities). However, it appears naturally in a wide variety of contexts, for instance interpretability of theories and word problems of subgroups. Let Dm and Rm denote t...
WORKING WITH STRONG REDUCIBILITIES ABOVE TOTALLY ωC.E. DEGREES
"... Abstract. We investigate the connections between the complexity of a c.e. set, as calibrated by its strength as an oracle for Turing computations of functions in the Ershov hierarchy, and how strong reducibilities allows us to compute such sets. For example, we prove that a c.e. degree is totally ω ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. We investigate the connections between the complexity of a c.e. set, as calibrated by its strength as an oracle for Turing computations of functions in the Ershov hierarchy, and how strong reducibilities allows us to compute such sets. For example, we prove that a c.e. degree is totally ωc.e. iff every set in it is weak truthtable reducible to a hypersimple, or ranked, set. We also show that a c.e. degree is array computable iff every leftc.e. real of that degree is reducible in a computable Lipschitz way to a random leftc.e. real (an Ωnumber). 1.
Global Properties of Degree Structures
"... We investigate degree structures induced by manyone reducibility and Turing reducibility on the computably enumerable (c.e.), the arithmetical all all subsets of N. We study which subsets of the degree structure automorphism bases: for instance the minimal degrees form an automorphism base for ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We investigate degree structures induced by manyone reducibility and Turing reducibility on the computably enumerable (c.e.), the arithmetical all all subsets of N. We study which subsets of the degree structure automorphism bases: for instance the minimal degrees form an automorphism base for the c.e. many one degrees, but not for the other degree structures based on m . We develop a method to show a subset is an automorphism base and apply it to the c.e. mdegrees and to give a modified proof of a result of AmbosSpies that initial intervals of the c.e. degrees are automorphism bases. Also, we show that the arithmetical mdegrees form a prime model. A central topic of computability theory is the study of sets of natural numbers under a notion of relative computability. Specifying a reducibility and an appropriate class of sets gives rise to a degree structure which may have interesting "global" properties. This is the case for the degree structures induced by manyone redu...
Parsimony Hierarchies for Inductive Inference
 Journal of Symbolic Logic
"... Freivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and "nearly" minimal size, i.e, within a computable function of being purely minimal size. Kinber showed that this parsimony requi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Freivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and "nearly" minimal size, i.e, within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. A limcomputable function is (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonious final programs by use of criteria which require the final, correct programs to be "notsonearly" minimal size, e.g., to be within a limcomputable function of actual minimal size. It is shown that some parsimony in the final program is thereby retained, yet learning power strictly increases. Considered, then, are limcomputable functions as above but for which notations for constructive ordinals are used to bound the number of mind changes allowed regarding the output. This is a variant of an idea introduced by Freivalds and Smith. For this ordinal notation complexity bounded version of limcomputability, the power of the resultant learning criteria form finely graded, infinitely ramifying, infinite hierarchies intermediate between the computable and the limcomputable cases. Some of these hierarchies, for the natural notations determining them, are shown to be optimally tight.
Gems In The Field Of Bounded Queries
"... Let A be a set. Given {x1 , . . . , xn}, I may want to know (1) which elements of {x1 , . . . , xn} are in A, (2) how many elements of {x1 , . . . , xn} are in A, or (3) is {x1 , . . . , xn}#A  even. All of these can be determined with n queries to A. For which A,n can we get by with fe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let A be a set. Given {x1 , . . . , xn}, I may want to know (1) which elements of {x1 , . . . , xn} are in A, (2) how many elements of {x1 , . . . , xn} are in A, or (3) is {x1 , . . . , xn}#A  even. All of these can be determined with n queries to A. For which A,n can we get by with fewer queries? Other questions involving `how many queries do you need to . . .' have been posed and (some) answered. This article is a survey of the gems in the fieldthe results that both answer an interesting question and have a nice proof. Keywords: Queries, Computability
Cupping and Noncupping in the Enumeration Degrees of ... Sets
"... We prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exists a nonzero noncuppable # 0 2 enumeration degree. Theorem B: Every nonzero # 0 2 enumeration degree is cuppable to 0 # e by an incomplete total enumeration degree. Theorem C: There exists a nonzero ..."
Abstract
 Add to MetaCart
We prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exists a nonzero noncuppable # 0 2 enumeration degree. Theorem B: Every nonzero # 0 2 enumeration degree is cuppable to 0 # e by an incomplete total enumeration degree. Theorem C: There exists a nonzero low # 0 2 enumeration degree with the anticupping property.
On Type2 Complexity Classes
 Proceedings of the Third International Workshop on Implicit Computational Complexity
, 2001
"... There are now a number of things called "highertype complexity classes." The most promenade of these is the class of basic feasible functionals [CU93, CK90], a fairly conservative highertype analogue the (type1) polynomialtime computable functions. There is however currently no satisfactory gene ..."
Abstract
 Add to MetaCart
There are now a number of things called "highertype complexity classes." The most promenade of these is the class of basic feasible functionals [CU93, CK90], a fairly conservative highertype analogue the (type1) polynomialtime computable functions. There is however currently no satisfactory general notion of what a highertype complexity class should be. In this paper we propose one such notion for type2 functionals and begin an investigation of its properties. The most striking di#erence between our type2 complexity classes and their type1 counterparts is that, because of topological constrains, the type2 classes have a much more ridged structure. Example: It follows from McCreight and Meyer's Union Theorem [MM69] that the (type1) polynomialtime computable functions form a complexity class (in the strict sense of Definition 1 below). The analogous result fails for the class of type2 basic feasible functionals. 1.