AbstractWe consider an abstract metric space with a computability structure and an effective separating set. In this article, we also introduce an effectively σ-compact space. The computability of real-valued functions on such a space is defined. It is shown that some of typical propositions in a metric space, namely Baire category theorem, Tietze's extension theorem and decomposition of unity, can be effectivized. It is also proved that computable functions are dense in continuous functions
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
We investigate conditions under which a co-computably enumerable set in acomputable metric space is ...
none2We study the Borel complexity of topological operations on closed subsets of computable metric...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
AbstractBased on standard notions of classical recursion theory, a natural model of approximate comp...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
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 closed setin a computable metric sp...
AbstractIn this paper we study different approaches to computability over effectively enumerable top...
In this paper we study different approaches to computability over effectively enumerable topological...
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
This article continues the study of computable elementary topology started bythe author and T. Grubb...
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
We investigate conditions under which a co-computably enumerable set in acomputable metric space is ...
none2We study the Borel complexity of topological operations on closed subsets of computable metric...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
AbstractBased on standard notions of classical recursion theory, a natural model of approximate comp...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
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 closed setin a computable metric sp...
AbstractIn this paper we study different approaches to computability over effectively enumerable top...
In this paper we study different approaches to computability over effectively enumerable topological...
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
This article continues the study of computable elementary topology started bythe author and T. Grubb...
We study the Borel complexity of topological operations on closed subsets of computable metric spac...
We investigate conditions under which a co-computably enumerable set in acomputable metric space is ...
none2We study the Borel complexity of topological operations on closed subsets of computable metric...