Extended admissibility.

From MaRDI portal
Revision as of 03:48, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1607303


DOI10.1016/S0304-3975(01)00109-8zbMath1042.68050MaRDI QIDQ1607303

Matthias Schröder

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)



Related Items

Unnamed Item, Towards a descriptive theory of cb0-spaces, Unnamed Item, An Effective Tietze-Urysohn Theorem for QCB-Spaces, Computable Riesz Representation for Locally Compact Hausdorff Spaces, Notions of Probabilistic Computability on Represented Spaces, Admissible Representations of Probability Measures, Representations and evaluation strategies for feasibly approximable functions, Unnamed Item, Unnamed Item, Computability of Subsets of Metric Spaces, Admissibly Represented Spaces and Qcb-Spaces, Weihrauch Complexity in Computable Analysis, Game characterizations and lower cones in the Weihrauch degrees, Computable analysis with applications to dynamic systems, When series of computable functions with varying domains are computable, On the topological aspects of the theory of represented spaces, Some hierarchies of QCB0-spaces, Computability of finite-dimensional linear subspaces and best approximation, Representing probability measures using probabilistic processes, Topological properties of concept spaces (full version), A computable version of Banach's inverse mapping theorem, Computability on subsets of metric spaces., Hierarchies of total functionals over the reals, 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, Parametrised second-order complexity theory with applications to the study of interval computation, Base-complexity classifications of qcb0-spaces1, 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



Cites Work