Type 2 recursion theory

DOI10.1016/0304-3975(85)90207-5zbMath0588.03030OpenAlexW2045368155MaRDI QIDQ1073021

Weihrauch, Klaus

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)90207-5

zbMATH Keywords

computabilitycontinuous functionscomputably open subsets

Mathematics Subject Classification ID

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

Related Items

Computability of measurable sets via effective topologies, Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, Coalgebraic Representation Theory of Fractals, Compactness in constructive analysis revisited, Representations of the real numbers and of the open subsets of the set of real numbers, Computable reducibility of metrics on the reals, Using macrotransducers to specify partial continuous operators in metric spaces, THE DISCONTINUITY PROBLEM, On the complexity of online computations of real functions, A Relationship between Equilogical Spaces and Type Two Effectivity, On the topological aspects of the theory of represented spaces, Type 2 computational complexity of functions on Cantor's space, Computability on computable metric spaces, \(\delta\)-uniform BSS machines, Computability on continuous, lower semi-continuous and upper semi-continuous real functions, The Turing closure of an Archimedean field, Equality is a jump, Computability on subsets of Euclidean space. I: Closed and compact subsets, An effective Riemann Mapping Theorem, Effectiveness of the global modulus of continuity on metric spaces, Computability of Self-Similar Sets, Real number computation through Gray code embedding., A Real Number Structure that is Effectively Categorical, Theory of representations, Three concepts of decidability for general subsets of uncountable spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Admissible representations of effective cpo's
• Theory of representations
• Computability concepts for programming language semantics
• Filter spaces and continuous functionals
• Recursion theoretic operators and morphisms on numbered sets
• The hereditary partial effective functionals and recursion theory in higher types
• Theorie der Numerierungen I
• Data Types as Lattices
• A Machine-Independent Theory of the Complexity of Recursive Functions