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
A Foundation for Computable Analysis
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
The Inversion Problem for Computable Linear Operators
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
Hierarchies of total functionals over the reals
Theoretical Computer Science - Logic, semantics and theory of programming
Representing probability measures using probabilistic processes
Journal of Complexity
Admissible Representations of Probability Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Two preservation results for countable products of sequential spaces
Mathematical Structures in Computer Science
Computable Riesz Representation for Locally Compact Hausdorff Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of Probabilistic Computability on Represented Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Borel Complexity of Topological Operations on Computable Metric Spaces
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Topological Properties of Concept Spaces
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
An Effective Tietze-Urysohn Theorem for QCB-Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Reducibility of domain representations and cantor–weihrauch domain representations
Mathematical Structures in Computer Science
The sequential topology on is not regular
Mathematical Structures in Computer Science
Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Topological properties of concept spaces (full version)
Information and Computation
Selection functions, bar recursion and backward induction
Mathematical Structures in Computer Science
Partial continuous functions and admissible domain representations
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Admissible representations in computable analysis
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Computing with sequences, weak topologies and the axiom of choice
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
| Hi-index | 5.23 |
We give a new definition of admissible representations which allows to handle also non countably-based topological spaces in the framework of Type-2 Theory of Effectivity. We prove that admissible representations δx, δy of topological spaces x,y have the desirable property that every partial function f :⊆ X → Y is continuously realizable with respect to δx, δy if and only if f is sequentially continuous. Furthermore, we characterize the class of the spaces having an admissible representation. Many interesting operators creating new topological spaces from old ones are shown to preserve the property of having an admissible representation. In particular, the class of sequential spaces with admissible representations turns out to be cartesian-closed. Thus, a reasonable computability theory is possible on important non countably-based spaces.