14 citations · 33 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.LO2019
On the complexity of classifying Lebesgue spaces
Tyler Brown, Alexander G. Melnikov, Timothy H. McNicholl
Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
cs.LO2019
Random Subgroups of Rationals
Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov +4
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup of rationals, two main…