Theory of representations

DOI10.1016/0304-3975(85)90208-7zbMath0588.03031OpenAlexW2168229531MaRDI QIDQ1073022

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90208-7

zbMATH Keywords

admissible representation effectivity on sets final topology of a representation type 2 computability

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)

Related Items

The fixed-point property for represented spaces, A semilattice of degrees of computable metrics, Exact real computation of solution operators for linear analytic systems of partial differential equations, Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, Three topological reducibilities for discontinuous functions, Alan Turing and the Foundations of Computable Analysis, Coalgebraic Representation Theory of Fractals, On the maximality of degrees of metrics under computable reducibility, Compactness in constructive analysis revisited, Axiomatic reals and certified efficient exact real computation, Representations of the real numbers and of the open subsets of the set of real numbers, Degrees of unsolvability of continuous functions, Computing Schrödinger propagators on type-2 Turing machines, Computable reducibility of metrics on the reals, Unnamed Item, A comparison of concepts from computable analysis and effective descriptive set theory, Towards a descriptive theory of cb₀-spaces, THE DISCONTINUITY PROBLEM, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, Random elements in effective topological spaces with measure., Notes on overt choice, How much partiality is needed for a theory of computability?, Reducibility of computable metrics on the real line, How constructive is constructing measures?, Completion of choice, Coherence Spaces and Uniform Continuity, When series of computable functions with varying domains are computable, Quantitative continuity and Computable Analysis in Coq, Theses for Computation and Recursion on Concrete and Abstract Structures, A Wadge hierarchy for second countable spaces, On the complexity of online computations of real functions, A Natural Weak Limit Space with Admissible Representation which is not a Limit Space, The Solution Operator of the Korteweg-de Vries Equation is Computable, A Relationship between Equilogical Spaces and Type Two Effectivity, A Functional Algorithm for Exact Real Integration with Invariant Measures, Computable Riesz Representation for Locally Compact Hausdorff Spaces, On the topological aspects of the theory of represented spaces, Some hierarchies of QCB₀-spaces, Type 2 computational complexity of functions on Cantor's space, Computable metrics above the standard real metric, Parametrised second-order complexity theory with applications to the study of interval computation, Base-complexity classifications of qcb0-spaces1, Computability on computable metric spaces, \(\delta\)-uniform BSS machines, Continuous and monotone machines, A domain-theoretic approach to computability on the real line, Computability on the probability measures on the Borel sets of the unit interval, Computability on continuous, lower semi-continuous and upper semi-continuous real functions, Equality is a jump, Computability on subsets of Euclidean space. I: Closed and compact subsets, Computable Banach spaces via domain theory, An effective Riemann Mapping Theorem, Concrete models of computation for topological algebras, Computation by `While' programs on topological partial algebras, Computability on the probability measures on the Borel sets of the unit interval, Effectiveness of the global modulus of continuity on metric spaces, Unnamed Item, Unnamed Item, WEIHRAUCH GOES BROUWERIAN, On the complexity of conversion between classic real number representations, Quantitative coding and complexity theory of compact metric spaces, Admissibly Represented Spaces and Qcb-Spaces, Weihrauch Complexity in Computable Analysis, Topological properties of real number representations., Foundation of a computable solid modelling., Extended admissibility., A Real Number Structure that is Effectively Categorical, Type 2 recursion theory

Cites Work