ORIENTATION OF PIECEWISE POWERS OF A MINIMAL HOMEOMORPHISM

We show that, given a compact minimal system $(X,g)$ and an element h of the topological full group $\tau [g]$ of g, the infinite orbits of h admit a locally constant orientation with respect to the orbits of g. We use this to obtain a clopen partition of $(X,G)$ into minimal and periodic parts, where G is any virtually polycyclic subgroup of $\tau [g]$ . We also use the orientation of orbits to give a refinement of the index map and to describe the role in $\tau [g]$ of the submonoid generated by the induced transformations of g. Finally, we consider the problem, given a homeomorphism h of the Cantor space X, of determining whether or not there exists a minimal homeomorphism g of X such that $h \in \tau [g]$ .

Randomness and Computability

<p>This thesis establishes significant new results in the area of algorithmic randomness. These results elucidate the deep relationship between randomness and computability. A number of results focus on randomness for finite strings. Levin introduced two functions which measure the randomness of finite strings. One function is derived from a universal monotone machine and the other function is derived from an optimal computably enumerable semimeasure. Gacs proved that infinitely often, the gap between these two functions exceeds the inverse Ackermann function (applied to string length). This thesis improves this result to show that infinitely often the difference between these two functions exceeds the double logarithm. Another separation result is proved for two different kinds of process machine. Information about the randomness of finite strings can be used as a computational resource. This information is contained in the overgraph. Muchnik and Positselsky asked whether there exists an optimal monotone machine whose overgraph is not truth-table complete. This question is answered in the negative. Related results are also established. This thesis makes advances in the theory of randomness for infinite binary sequences. A variant of process machines is used to characterise computable randomness, Schnorr randomness and weak randomness. This result is extended to give characterisations of these types of randomness using truthtable reducibility. The computable Lipschitz reducibility measures both the relative randomness and the relative computational power of real numbers. It is proved that the computable Lipschitz degrees of computably enumerable sets are not dense. Infinite binary sequences can be regarded as elements of Cantor space. Most research in randomness for Cantor space has been conducted using the uniform measure. However, the study of non-computable measures has led to interesting results. This thesis shows that the two approaches that have been used to define randomness on Cantor space for non-computable measures: that of Reimann and Slaman, along with the uniform test approach first introduced by Levin and also used by Gacs, Hoyrup and Rojas, are equivalent. Levin established the existence of probability measures for which all infinite sequences are random. These measures are termed neutral measures. It is shown that every PA degree computes a neutral measure. Work of Miller is used to show that the set of atoms of a neutral measure is a countable Scott set and in fact any countable Scott set is the set of atoms of some neutral measure. Neutral measures are used to prove new results in computability theory. For example, it is shown that the low computable enumerable sets are precisely the computably enumerable sets bounded by PA degrees strictly below the halting problem. This thesis applies ideas developed in the study of randomness to computability theory by examining indifferent sets for comeager classes in Cantor space. A number of results are proved. For example, it is shown that there exist 1-generic sets that can compute their own indifferent sets.</p>

Randomness and Computability

<p>This thesis establishes significant new results in the area of algorithmic randomness. These results elucidate the deep relationship between randomness and computability. A number of results focus on randomness for finite strings. Levin introduced two functions which measure the randomness of finite strings. One function is derived from a universal monotone machine and the other function is derived from an optimal computably enumerable semimeasure. Gacs proved that infinitely often, the gap between these two functions exceeds the inverse Ackermann function (applied to string length). This thesis improves this result to show that infinitely often the difference between these two functions exceeds the double logarithm. Another separation result is proved for two different kinds of process machine. Information about the randomness of finite strings can be used as a computational resource. This information is contained in the overgraph. Muchnik and Positselsky asked whether there exists an optimal monotone machine whose overgraph is not truth-table complete. This question is answered in the negative. Related results are also established. This thesis makes advances in the theory of randomness for infinite binary sequences. A variant of process machines is used to characterise computable randomness, Schnorr randomness and weak randomness. This result is extended to give characterisations of these types of randomness using truthtable reducibility. The computable Lipschitz reducibility measures both the relative randomness and the relative computational power of real numbers. It is proved that the computable Lipschitz degrees of computably enumerable sets are not dense. Infinite binary sequences can be regarded as elements of Cantor space. Most research in randomness for Cantor space has been conducted using the uniform measure. However, the study of non-computable measures has led to interesting results. This thesis shows that the two approaches that have been used to define randomness on Cantor space for non-computable measures: that of Reimann and Slaman, along with the uniform test approach first introduced by Levin and also used by Gacs, Hoyrup and Rojas, are equivalent. Levin established the existence of probability measures for which all infinite sequences are random. These measures are termed neutral measures. It is shown that every PA degree computes a neutral measure. Work of Miller is used to show that the set of atoms of a neutral measure is a countable Scott set and in fact any countable Scott set is the set of atoms of some neutral measure. Neutral measures are used to prove new results in computability theory. For example, it is shown that the low computable enumerable sets are precisely the computably enumerable sets bounded by PA degrees strictly below the halting problem. This thesis applies ideas developed in the study of randomness to computability theory by examining indifferent sets for comeager classes in Cantor space. A number of results are proved. For example, it is shown that there exist 1-generic sets that can compute their own indifferent sets.</p>

A context in which finite or unique ergodicity is generic

We show that for good measures, the set of homeomorphisms of Cantor space which preserve that measure and which have no invariant clopen sets contains a residual set of homeomorphisms which are uniquely ergodic. Additionally, we show that for refinable Bernoulli trial measures, the same set of homeomorphisms contains a residual set of homeomorphisms which admit only finitely many ergodic measures.

Conjugate subgroups and overgroups of Vn

We describe subgroups and overgroups of the generalized Thompson groups [Formula: see text] which arise via conjugation by rational homeomorphisms of Cantor space. We specifically consider conjugating [Formula: see text] by homeomorphisms induced by synchronizing transducers and their inverses. Our descriptions of the subgroups and overgroups use properties of the conjugating transducer to either restrict or augment the action of [Formula: see text] on Cantor space. We also consider a class [Formula: see text] of transducers containing all invertible, initial transducers. We associate to every transducer [Formula: see text] in this class, a group [Formula: see text]. We show that for a certain subclass of [Formula: see text], the groups [Formula: see text] are simple.

Limit group invariants for non-free Cantor actions

A Cantor action is a minimal equicontinuous action of a countably generated group $G$ on a Cantor space $X$ . Such actions are also called generalized odometers in the literature. In this work, we introduce two new conjugacy invariants for Cantor actions, the stabilizer limit group and the centralizer limit group. An action is wild if the stabilizer limit group is an increasing sequence of stabilizer groups without bound and otherwise is said to be stable if this group chain is bounded. For Cantor actions by a finitely generated group $G$ , we prove that stable actions satisfy a rigidity principle and furthermore show that the wild property is an invariant of the continuous orbit equivalence class of the action. A Cantor action is said to be dynamically wild if it is wild and the centralizer limit group is a proper subgroup of the stabilizer limit group. This property is also a conjugacy invariant and we show that a Cantor action with a non-Hausdorff element must be dynamically wild. We then give examples of wild Cantor actions with non-Hausdorff elements, using recursive methods from geometric group theory to define actions on the boundaries of trees.

COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related.(T.1) A basic property of Cantor space$2^ $ is Heine–Borel compactness: for any open covering of $2^ $, there is a finite subcovering. A natural question is: How hard is it to compute such a finite subcovering? We make this precise by analysing the complexity of so-called fan functionals that given any $G:2^ \to $, output a finite sequence $\langle f_0 , \ldots ,f_n \rangle $ in $2^ $ such that the neighbourhoods defined from $\overline {f_i } G\left( {f_i } \right)$ for $i \le n$ form a covering of $2^ $.(T.2) A basic property of Cantor space in Nonstandard Analysis is Abraham Robinson’s nonstandard compactness, i.e., that every binary sequence is “infinitely close” to a standard binary sequence. We analyse the strength of this nonstandard compactness property of Cantor space, compared to the other axioms of Nonstandard Analysis and usual mathematics.Our study of (T.1) yields exotic objects in computability theory, while (T.2) leads to surprising results in Reverse Mathematics. We stress that (T.1) and (T.2) are highly intertwined, i.e., our study is holistic in nature in that results in computability theory yield results in Nonstandard Analysis and vice versa.