Type 2 recursion theory
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3783068 (Why is no real title available?)
- scientific article; zbMATH DE number 3255438 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Admissible representations of effective cpo's
- Computability concepts for programming language semantics
- Data Types as Lattices
- 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
- Theory of representations
Cited in
(32)- Computability of measurable sets via effective topologies
- Representations of the real numbers and of the open subsets of the set of real numbers
- Computability on computable metric spaces
- On the topological aspects of the theory of represented spaces
- scientific article; zbMATH DE number 4037847 (Why is no real title available?)
- \(\delta\)-uniform BSS machines
- Using macrotransducers to specify partial continuous operators in metric spaces
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Equality is a jump
- Real number computation through Gray code embedding.
- Effectiveness of the global modulus of continuity on metric spaces
- The Turing closure of an Archimedean field
- Coalgebraic representation theory of fractals
- A blend of methods of recursion theory and topology.
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions
- A relationship between equilogical spaces and type two effectivity
- Computability of Self-Similar Sets
- Compactness in constructive analysis revisited
- Computable reducibility of metrics on the reals
- THE DISCONTINUITY PROBLEM
- On the complexity of online computations of real functions
- On representations of irrational numbers and the computational complexity of converting between such representations
- A Real Number Structure that is Effectively Categorical
- Effective bases and notions of effective second countability in computable analysis
- scientific article; zbMATH DE number 3950508 (Why is no real title available?)
- Theory of representations
- Recursion theoretic operators and morphisms on numbered sets
- Three concepts of decidability for general subsets of uncountable spaces
- Type 2 computational complexity of functions on Cantor's space
- An effective Riemann Mapping Theorem
- scientific article; zbMATH DE number 3878916 (Why is no real title available?)
This page was built for publication: Type 2 recursion theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073021)
