Recursive metric spaces
From MaRDI portal
Publication:5625126
DOI10.4064/fm-55-3-215-238zbMath0221.02015OpenAlexW237194509MaRDI QIDQ5625126
Publication date: 1964
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213786
Related Items
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis, Unnamed Item, Lower bounds on degrees of game-theoretic structures, On images of partial computable functions over computable Polish 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 elements and functions in effectively enumerable topological spaces, Some results related to the continuity problem, Unnamed Item, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, Separating notions in effective topology, COMPUTABLY COMPACT METRIC SPACES, Reducibility of computable metrics on the real line, Computable preference and utility, Recursive quasi-metric spaces., Computability and the morphological complexity of some dynamics on continuous domains, Stability of representations of effective partial algebras, Domain representability of metric spaces, 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, Stability for Effective Algebras, Towards Computability over Effectively Enumerable Topological Spaces, On the Continuity of Effective Multifunctions, Models of computation for partial functions on the reals, Total sets and objects in domain theory, 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, Outline of partial computability in computable topology, Choice and complexity, Unnamed Item, Representations versus numberings: On the relationship of two computability notions, Computability on computable metric spaces, 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, Degrees of non-computability of homeomorphism types of Polish spaces, Domain representations of partial functions, with applications to spatial objects and constructive volume geometry., A Real Number Structure that is Effectively Categorical, On effectively computable realizations of choice functions
