Complexity theory of real functions
Complexity theory of real functions
Computability on computable metric spaces
Theoretical Computer Science
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Concrete models of computation for topological algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Effective properties of sets and functions in metric spaces with computability structure
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Computability theory of generalized functions
Journal of the ACM (JACM)
Theoretical Computer Science - Topology in computer science
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
Continuity and computability of reachable sets
Theoretical Computer Science
A computable version of dini's theorem for topological spaces
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Computable Riesz Representation for Locally Compact Hausdorff Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper we investigate aspects of effectivity and computability on closed and compact subsets of locally compact spaces. We use the framework of the representation approach, TTE, where continuity and computability on finite and infinite sequences of symbols are defined canonically and transferred to abstract sets by means of notations and representations. This work is a generalization of the concepts introduced in [4] and [22] for the Euclidean case and in [3] for metric spaces. Whenever reasonable, we transfer a representation of the set of closed or compact subsets to locally compact spaces and discuss its properties and their relations to each other.