Rebecca Weber

Algorithmic Randomness of Closed Sets

We investigate notions of randomness in the space C[2N] of non-empty closed subsets of {0,1}N. A probability measure is given and a version of the Martin-Lof test for randomness is defined. Π20 random closed sets exist but there are no random Π10 closed sets. It is shown that any random closed set is perfect, has measure 0, and has box dimension log2(4/3). A random closed set has no n-c.e. elements. A closed subset of 2N may be defined as the set of infinite paths through a tree and so the problem of compressibility of trees is explored. If Tn = T∩{0,1}n, then for any random closed set [T] where T has no dead ends, K(Tn)≥n-O(1) but for any k, K(Tn) ≤ 2n − k + O(1), where K(σ) is the prefix-free complexity of σ∈{0,1}*.

Totally ω-computably enumerable degrees and bounding critical triples

We characterize the class of c.e. degrees that bound a critical triple (equivalently, a weak critical triple) as those degrees that compute a function that has no ω-c.e. approximation.

Algorithmic randomness of continuous functions

We investigate notions of randomness in the space

K-Triviality of Closed Sets and Continuous Functions

{{\mathcal C}(2^{\mathbb N})}

Effective Randomness of Unions and Intersections

of continuous functions on

Lowness for effective Hausdorff dimension

{2^{\mathbb N}}