activity
20062018
most citedThe Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs

43 citations · 150 across the 18 of their papers we have counts for

collaborators

22 papers

math.LO2018

Effective Randomness for Continuous Measures

Jan Reimann, Theodore A. Slaman

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all…

math.LO2017★ 3 cited

The strength of Ramsey's theorem for pairs and arbitrarily many colors

Theodore A. Slaman, Keita Yokoyama

In this paper, we show that is a -conservative extension of .

math.NT2017

On the construction of absolutely normal numbers

Christoph Aistleitner, Verónica Becher, Adrian-Maria Scheerer +1

We give a construction of an absolutely normal real number such that for every integer greater than or equal to , the discrepancy of the first terms of the sequence…

math.NT2017

On absolutely normal numbers and their discrepancy estimate

Verónica Becher, Adrian-Maria Scheerer, Theodore Slaman

We construct the base expansion of an absolutely normal real number so that, for every integer greater than or equal to , the discrepancy modulo of the sequence…

math.LO2016

On the existence of a strong minimal pair

George Barmpalias, Mingzhong Cai, Steffen Lempp +1

We show that there is a strong minimal pair in the computably enumerable Turing degrees.

math.NT2016

Irrationality Exponent, Hausdorff Dimension and Effectivization

Verónica Becher, Jan Reimann, Theodore A. Slaman

We generalize the classical theorem by Jarnik and Besicovitch on the irrationality exponents of real numbers and Hausdorff dimension. Let a be any real number greater than or equal…