Theory of representations
From MaRDI portal
Publication:1073022
DOI10.1016/0304-3975(85)90208-7zbMath0588.03031MaRDI QIDQ1073022
Weihrauch, Klaus, Christoph Kreitz
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
admissible representation; effectivity on sets; final topology of a representation; type 2 computability
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
03D65: Higher-type and set recursion theory
Related Items
Degrees of unsolvability of continuous functions, Computing Schrödinger propagators on type-2 Turing machines, Type 2 recursion theory, Compactness in constructive analysis revisited, Representations of the real numbers and of the open subsets of the set of real numbers, On the complexity of online computations of real functions, \(\delta\)-uniform BSS machines, A domain-theoretic approach to computability on the real line, 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, Random elements in effective topological spaces with measure., Computability on continuous, lower semi-continuous and upper semi-continuous real functions, Topological properties of real number representations., Foundation of a computable solid modelling., Extended admissibility., Computability on computable metric spaces, Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, Type 2 computational complexity of functions on Cantor's space, A Real Number Structure that is Effectively Categorical
Cites Work
- Admissible representations of effective cpo's
- Type 2 recursion theory
- Computational complexity of real functions
- Computability concepts for programming language semantics
- L p -Computability in Recursive Analysis
- Effective operations on partial recursive functions
- Theorie der Numerierungen I
- Data Types as Lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
