8 citations · 29 across the 22 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.LO2019
Computing the exponent of a Lebesgue space
Timothy H. McNicholl
We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjectur…
math.LO2019
Degrees of and lowness for isometric isomorphism
Johanna N. Y. Franklin, Timothy H. McNicholl
We contribute to the program of extending computable structure theory to the realm of metric structures by investigating lowness for isometric isomorphism of metric structures. We…
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.