Computability
Complexity theory of real functions
Complexity theory of real functions
Concrete models of computation for topological algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
Topological and limit-space subcategories of countably-based equilogical spaces
Mathematical Structures in Computer Science
Hierarchies of total functionals over the reals
Theoretical Computer Science - Logic, semantics and theory of programming
Computing Schrödinger propagators on Type-2 Turing machines
Journal of Complexity
On the Relationship between Filter Spaces and Weak Limit Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Internal Density Theorems for Hierarchies of Continuous Functionals
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Admissible representations in computable analysis
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Computability on random events and variables in a computable probability space
Theoretical Computer Science
| Hi-index | 0.00 |
We give a definition of admissible representations for (weak) limit spaces which allows to handle also non topological spaces in the framework of TTE (Type-2 Theory of Effectivity). Limit spaces and weak limit spaces spaces are generalizations of topological spaces. We prove that admissible representations 驴X; 驴D of weak limit spaces X, D have the desirable property that every partial function f between them is continuously realizable with respect to 驴X; 驴D, iff f is sequentially continuous. Furthermore, we characterize the class of the spaces having an admissible representation. The category of these spaces (equipped with the total sequential continuous functions as morphisms) turns out to be bicartesian-closed. It contains all countably-based T0-spaces. Thus, a reasonable computability theory is possible on important non countably-based topological spaces as well as on non topological spaces.