We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if p ≥ 1 is a computable real, and if Ω is a nonzero, non-atomic, and separable measure space, then every computable presentation of Lᵖ(Ω) is computably linearly isometric to the standard computable presentation of Lᵖ[0, 1]; in particular, Lᵖ[0, 1] is computably categorical. We also show that there is a measure space Ω that does not have a computable presentation even though Lᵖ(Ω) does for every computable real p ≥ 1
Abstract: This article continues the study of computable elementary topology started in [Weihrauch a...
AbstractWe show that the existence of a nontrivial proper subspace of a vector space of dimension gr...
We revise and extend the foundation of computable topology in the framework of Type-2 theory of effe...
We continue the investigation of analytic spaces from the perspective of computable structure theory...
Suppose p is a computable real so that p ≥ 1. It is shown that the halting set can compute a surject...
Suppose that p is a computable real and that p \u3e= 1. We show that in both the real and complex ca...
We investigate structures of size at most continuum using various techniques originating from comput...
We investigate structures of size at most continuum using various techniques originating from comput...
We investigate structures of size at most continuum using various techniques originating from comput...
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is act...
International audienceA compact set has computable type if any homeomorphic copy of the set which is...
AbstractEvery second-countable regular topological space X is metrizable. For a given “computable” t...
AbstractFive open problems are presented. The framework for these problems is the notion of a “compu...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
In this dissertation we investigate computability notions on several different Banach spaces, namely...
Abstract: This article continues the study of computable elementary topology started in [Weihrauch a...
AbstractWe show that the existence of a nontrivial proper subspace of a vector space of dimension gr...
We revise and extend the foundation of computable topology in the framework of Type-2 theory of effe...
We continue the investigation of analytic spaces from the perspective of computable structure theory...
Suppose p is a computable real so that p ≥ 1. It is shown that the halting set can compute a surject...
Suppose that p is a computable real and that p \u3e= 1. We show that in both the real and complex ca...
We investigate structures of size at most continuum using various techniques originating from comput...
We investigate structures of size at most continuum using various techniques originating from comput...
We investigate structures of size at most continuum using various techniques originating from comput...
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is act...
International audienceA compact set has computable type if any homeomorphic copy of the set which is...
AbstractEvery second-countable regular topological space X is metrizable. For a given “computable” t...
AbstractFive open problems are presented. The framework for these problems is the notion of a “compu...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
In this dissertation we investigate computability notions on several different Banach spaces, namely...
Abstract: This article continues the study of computable elementary topology started in [Weihrauch a...
AbstractWe show that the existence of a nontrivial proper subspace of a vector space of dimension gr...
We revise and extend the foundation of computable topology in the framework of Type-2 theory of effe...