Recursive metric spaces

Cited in

(49)

On effectively computable realizations of choice functions
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
Lower bounds on degrees of game-theoretic structures
On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
Total sets and objects in domain theory
Computable Banach spaces via domain theory
Concrete models of computation for topological algebras
Computation by `While' programs on topological partial algebras
Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
Recursive quasi-metric spaces.
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
Reducibility of computable metrics on the real line
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
A Banach-Mazur computable but not Markov computable function on the computable real numbers
Computability on computable metric spaces
Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
Recursive topological spaces
Effective inseparability in a topological setting
Computable preference and utility
Outline of partial computability in computable topology
Degrees of non-computability of homeomorphism types of Polish spaces
Models of computation for partial functions on the reals
On images of partial computable functions over computable Polish spaces
Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
Stability of representations of effective partial algebras
scientific article; zbMATH DE number 3563047 (Why is no real title available?)
A Real Number Structure that is Effectively Categorical
Computable elements and functions in effectively enumerable topological spaces
Some results related to the continuity problem
Stability for effective algebras
Towards computability over effectively enumerable topological spaces
On the continuity of effective multifunctions
Bi-topological spaces and the continuity problem
scientific article; zbMATH DE number 3230252 (Why is no real title available?)
Choice and complexity
Representations versus numberings: On the relationship of two computability notions
Separating notions in effective topology
COMPUTABLY COMPACT METRIC SPACES
Every \(\Delta^0_2\) Polish space is computable topological
Domain representability of metric spaces
Effective second countability in computable analysis
Remarks and problems about algorithmic descriptions of groups
Multi-representation associated to the numbering of a subbasis and formal inclusion relations
Computable topological groups
Comparing notions of presentability in Polish spaces and Polish groups
Effective bases and notions of effective second countability in computable analysis
Degree spectra of homeomorphism type of compact Polish spaces
Computability and the morphological complexity of some dynamics on continuous domains

This page was built for publication: Recursive metric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625126)