A semi-computable set S in a computable metric space need not be computable.However, in some cases, if S has certain topological properties, we canconclude that S is computable. It is known that if a semi-computable set S is acompact manifold with boundary, then the computability of \deltaS implies thecomputability of S. In this paper we examine the case when S is a 1-manifoldwith boundary, not necessarily compact. We show that a similar result holds inthis case under assumption that S has finitely many components
We continue the investigation of analytic spaces from the perspective of computable structure theory...
AbstractIn the context of possibly infinite computations yielding finite or infinite (binary) output...
We continue the investigation of analytic spaces from the perspective of computable structure theory...
We investigate conditions under which a co-computably enumerable closed setin a computable metric sp...
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...
We investigate conditions under which a co-computably enumerable set in acomputable metric space is ...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
AbstractEvery second-countable regular topological space X is metrizable. For a given “computable” t...
We examine conditions under which a semicomputable set in a computable metric space is computable. I...
We examine conditions under which a semicomputable set in a computable metric space is computable. I...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
We continue the investigation of analytic spaces from the perspective of computable structure theory...
AbstractIn the context of possibly infinite computations yielding finite or infinite (binary) output...
We continue the investigation of analytic spaces from the perspective of computable structure theory...
We investigate conditions under which a co-computably enumerable closed setin a computable metric sp...
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...
We investigate conditions under which a co-computably enumerable set in acomputable metric space is ...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
AbstractEvery second-countable regular topological space X is metrizable. For a given “computable” t...
We examine conditions under which a semicomputable set in a computable metric space is computable. I...
We examine conditions under which a semicomputable set in a computable metric space is computable. I...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
We continue the investigation of analytic spaces from the perspective of computable structure theory...
AbstractIn the context of possibly infinite computations yielding finite or infinite (binary) output...
We continue the investigation of analytic spaces from the perspective of computable structure theory...