3 citations · 9 across the 13 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016
Bounding the Dimension of Points on a Line
Neil Lutz, D. M. Stull
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to…
math.LO2016
The isometry degree of a computable copy of
Timothy H. McNicholl, D. M. Stull
When is a computable real so that , the isometry degree of a computable copy of is defined to be the least powerful Turing degree that computes…