6 papers · 1 filter
members of thin classes and generic degrees
Frank Stephan, Guohua Wu, Bowen Yuan
A class is thin if every subclass of is the intersection of with some clopen set. In 1993, Cenzer, Downey, Jockusch and Shore initiated the…
On the order dimension of locally countable partial orderings
Kojiro Higuchi, Steffen Lempp, Diip Raghavan +1
We show that the order dimension of the partial order of all finite subsets of under set inclusion is whenever is an infinite cardinal. We also…
Randomness and initial segment complexity for probability measures
Andre Nies, Frank Stephan
We study algorithmic randomness properties for probability measures on Cantor space. We say that a measure on the space of infinite bit sequences is ML absolutely continuous if…
Subrecursive Approximations of Irrational Numbers by Variable Base Sums
Ivan Georgiev, Lars Kristiansen, Frank Stephan
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fracti…
Covering the recursive sets
Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
We give solutions to two of the questions in a paper by Brendle, Brooke-Taylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct c…
Closure of resource-bounded randomness notions under polynomial time permutations
Andre Nies, Frank Stephan
An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is well-known that the property of recursive ra…