Recursive characterization of computable real-valued functions and relations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3112803 (Why is no real title available?)
- scientific article; zbMATH DE number 3167153 (Why is no real title available?)
- scientific article; zbMATH DE number 3952751 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 42114 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 542031 (Why is no real title available?)
- scientific article; zbMATH DE number 1003230 (Why is no real title available?)
- scientific article; zbMATH DE number 860046 (Why is no real title available?)
- scientific article; zbMATH DE number 3255437 (Why is no real title available?)
- scientific article; zbMATH DE number 3280051 (Why is no real title available?)
- scientific article; zbMATH DE number 3048796 (Why is no real title available?)
- A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
- Berechenbare Reelle Funktionen
- Berechenbare Reelle Funktionenfolgen
- Computability on computable metric spaces
- Computable functionals
- Computational complexity of real functions
- Feasible real random access machines
- Funktional‐Rekursion
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the Definition of Computable Function of a Real Variable
- On the definitions of computable real continuous functions
- Recursion theory on the reals and continuous-time computation
- The computable multi-functions on multi-represented sets are closed under programming
- Topologies on Spaces of Subsets
Cited in
(35)- RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS
- Admissibly Represented Spaces and Qcb-Spaces
- Relative computability and uniform continuity of relations
- A refined model of computation for continuous problems
- Feasible real random access machines
- Iterative Characterizations of Computable Unary Functions: A General Method
- Computable invariance
- Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computer Aided Systems Theory – EUROCAST 2005
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- Decidability in analysis
- scientific article; zbMATH DE number 1191235 (Why is no real title available?)
- scientific article; zbMATH DE number 7360045 (Why is no real title available?)
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Concrete models of computation for topological algebras
- Computation by `While' programs on topological partial algebras
- Feasible real random access machines
- Sequential real number computation and recursive relations
- Sequential real number computation and recursive relations
- scientific article; zbMATH DE number 1342214 (Why is no real title available?)
- Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
- A characterization of computable analysis on unbounded domains using differential equations
- On the topological aspects of the theory of represented spaces
- Semantics of a sequential language for exact real-number computation
- A Real Number Structure that is Effectively Categorical
- Recursion theory on the reals and continuous-time computation
- A Galois connection between Turing jumps and limits
- scientific article; zbMATH DE number 4094815 (Why is no real title available?)
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
- How constructive is constructing measures?
- scientific article; zbMATH DE number 1746045 (Why is no real title available?)
- First-order universality for real programs
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- Relatively computable functions of real variables
This page was built for publication: Recursive characterization of computable real-valued functions and relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349924)
