Computability theory evaluates the complexity of classifying Lebesgue spaces and associated isometric isomorphism problems.
Rabin, Computable algebra, general theory and theory of computabl e fields
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the complexity of classifying Lebesgue spaces
Computability theory evaluates the complexity of classifying Lebesgue spaces and associated isometric isomorphism problems.