Type 2 recursion theory
An attempt is made to lay a basis for a general, unified, concise, and simple theory of computable and continuous functions from \({\mathbb{F}}\) to \({\mathbb{F}}\) or \({\mathbb{N}}\), where \({\mathbb{F}}=\{f:{\mathbb{N}}\to {\mathbb{N}}\}\). The theory is formally very similar to ordinary recursion theory. It splits into a purely topological version and more special theory of computability. The basic definitions are given and fundamental properties are proved. As an example it is shown how the theory of recursively enumerable subsets of \({\mathbb{N}}\) can be transferred to a theory of open and a theory of computably open subsets of \({\mathbb{F}}\).
- 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
- 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?)
- 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
- Theory of representations
- 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
- 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
- Using macrotransducers to specify partial continuous operators in metric spaces
- A blend of methods of recursion theory and topology.
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions
- The Turing closure of an Archimedean field
- Real number computation through Gray code embedding.
- Computability on computable metric spaces
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computable reducibility of metrics on the reals
- Type 2 computational complexity of functions on Cantor's space
- Coalgebraic representation theory of fractals
- Recursion theoretic operators and morphisms on numbered sets
- scientific article; zbMATH DE number 3878916 (Why is no real title available?)
- scientific article; zbMATH DE number 3950508 (Why is no real title available?)
- scientific article; zbMATH DE number 4037847 (Why is no real title available?)
- scientific article; zbMATH DE number 1222088 (Why is no real title available?)
- Computability of Self-Similar Sets
- A Real Number Structure that is Effectively Categorical
- A relationship between equilogical spaces and type two effectivity
- On the topological aspects of the theory of represented spaces
- THE DISCONTINUITY PROBLEM
- On representations of irrational numbers and the computational complexity of converting between such representations
- Effective bases and notions of effective second countability in computable analysis
- Three concepts of decidability for general subsets of uncountable spaces
- Computability of measurable sets via effective topologies
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)
