26 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
Arithmetic complexity via effective names for random sequences
We investigate enumerability properties for classes of sets which permit
recursive, lexicographically increasing approximations, or left-r.e. sets. In
addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably,
Schnorr, and Kurtz random sets, weakly 1-generics and their complementary
classes, we find that there exist characterizations of the third and fourth
levels of the arithmetic hierarchy purely in terms of these notions.
More generally, there exists an equivalence between arithmetic complexity and
existence of numberings for classes of left-r.e. sets with shift-persistent
elements. While some classes (such as Martin-L\"{o}f randoms and Kurtz
non-randoms) have left-r.e. numberings, there is no canonical, or acceptable,
left-r.e. numbering for any class of left-r.e. randoms.
Finally, we note some fundamental differences between left-r.e. numberings
for sets and reals
Topics in Algorithmic Randomness and Computability Theory
This thesis establishes results in several different areas of computability theory.
The first chapter is concerned with algorithmic randomness. A well-known approach to the definition of a random infinite binary sequence is via effective betting strategies. A betting strategy is called integer-valued if it can bet only in integer amounts. We consider integer-valued random sets, which are infinite binary sequences such that no effective integer-valued betting strategy wins arbitrarily much money betting on the bits of the sequence. This is a notion that is much weaker than those normally considered in algorithmic randomness. It is sufficiently weak to allow interesting interactions with topics from classical computability theory, such as genericity and the computably enumerable degrees. We investigate the computational power of the integer-valued random sets in terms of standard notions from computability theory.
In the second chapter we extend the technique of forcing with bushy trees. We use this to construct an increasing ѡ-sequence 〈an〉 of Turing degrees which forms an initial segment of the Turing degrees, and such that each an₊₁ is diagonally noncomputable relative to an. This shows that the DNR₀ principle of reverse mathematics does not imply the existence of Turing incomparable degrees.
In the final chapter, we introduce a new notion of genericity which we call ѡ-change genericity. This lies in between the well-studied notions of 1- and 2-genericity. We give several results about the computational power required to compute these generics, as well as other results which compare and contrast their behaviour with that of 1-generics
Genericity and UD-random reals
Avigad introduced the notion of UD–randomness based in Weyl’s 1916 definition of uniform distribution modulo one. We prove that there exists a weakly 1–random real that is neither UD–random nor weakly 1–generic. We also show that no 2–generic real can Turing compute a UD–random real
Degrees that are low for isomorphism
We say that a degree is low for isomorphism if, whenever it can compute an isomorphism between a pair of computable structures, there is already a computable isomorphism between them. We show that while there is no clear-cut relationship between this property and other properties related to computational weakness, the low-forisomorphism degrees contain all Cohen 2-generics and are disjoint from the Martin-Löf randoms. We also consider lowness for isomorphism with respect to the class of linear orders.