Extended admissibility.
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 \(\delta_{X},\delta_{Y}\) of topological spaces \(X,Y\) have the desirable property that every partial function \(f\subseteq X\rightarrow Y\) is continuously realizable with respect to \(\delta_{X},\delta_{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.
- Concrete models of computation for topological algebras
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 42114 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1222088 (Why is no real title available?)
- scientific article; zbMATH DE number 2013199 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- On the definitions of computable real continuous functions
- Theory of representations
- A computable version of Banach's inverse mapping theorem
- Computability on subsets of metric spaces.
- Hierarchies of total functionals over the reals
- Topological properties of real number representations.
- Comparing representations for function spaces in computable analysis
- On the information carried by programs about the objects they compute
- Comparing Cartesian closed categories of (core) compactly generated spaces
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Game characterizations and lower cones in the Weihrauch degrees
- On the computability of the set of automorphisms of the unit square
- Some notes on spaces of ideals and computable topology
- Parametrised second-order complexity theory with applications to the study of interval computation
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces
- A convenient category of domains
- Coherence spaces and uniform continuity
- Stability of representations of effective partial algebras
- Weihrauch degrees, omniscience principles and weak computability
- Topological Properties of Concept Spaces
- Reducibility of domain representations and Cantor–Weihrauch domain representations
- Selection functions, bar recursion and backward induction
- The sequential topology on is not regular
- scientific article; zbMATH DE number 1969324 (Why is no real title available?)
- scientific article; zbMATH DE number 1746044 (Why is no real title available?)
- A Galois connection between Turing jumps and limits
- Towards a descriptive theory of cb\(_{0}\)-spaces
- An effective Tietze-Urysohn theorem for QCB-spaces (extended abstract)
- Computable Riesz representation for locally compact Hausdorff spaces
- Notions of Probabilistic Computability on Represented Spaces
- Admissible representations of probability measures
- Computable analysis and notions of continuity in \textsc{Coq}
- Representations and evaluation strategies for feasibly approximable functions
- Computability of Subsets of Metric Spaces
- Admissibly Represented Spaces and Qcb-Spaces
- Weihrauch Complexity in Computable Analysis
- Three topological reducibilities for discontinuous functions
- Effective aspects of Hausdorff and Fourier dimension
- Uniform envelopes
- Foundations of online structure theory. II: The operator approach
- Decision problems for linear recurrences involving arbitrary real numbers
- Computable analysis with applications to dynamic systems
- Game characterizations and lower cones in the Weihrauch degrees
- When series of computable functions with varying domains are computable
- Partial Continuous Functions and Admissible Domain Representations
- On the topological aspects of the theory of represented spaces
- Some hierarchies of \(\mathsf{QCB}_0\)-spaces
- Point Degree Spectra of Represented Spaces
- Quantitative continuity and Computable Analysis in Coq
- Logical Approaches to Computational Barriers
- Logical Approaches to Computational Barriers
- A syntactic approach to Borel functions: some extensions of Louveau's theorem
- Computability of finite-dimensional linear subspaces and best approximation
- Descriptive complexity on non-Polish spaces. II
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
- Multi-representation associated to the numbering of a subbasis and formal inclusion relations
- Sequential discontinuity and first-order problems
- A topologically enriched probability monad on the Cartesian closed category of CGWH spaces
- Representing probability measures using probabilistic processes
- Topological properties of concept spaces (full version)
This page was built for publication: Extended admissibility.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607303)
