Computability theory evaluates the complexity of classifying Lebesgue spaces and associated isometric isomorphism problems.
Rogers, Theory of recursive functions and effective computability , second ed., MIT Press, Cambridge, MA
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.