Recursive characterization of computable real-valued functions and relations

DOI10.1016/0304-3975(95)00249-9zbMath0871.68028OpenAlexW2087950601MaRDI QIDQ1349924

Vasco Brattka

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00249-9

zbMATH Keywords

Turing machinesdensely computable relationsrecursive relations in metric spaces

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (22)

Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ Semantics of a sequential language for exact real-number computation ⋮ Relative computability and uniform continuity of relations ⋮ Sequential real number computation and recursive relations ⋮ How constructive is constructing measures? ⋮ Sequential Real Number Computation and Recursive Relations ⋮ First-Order Universality for Real Programs ⋮ On the topological aspects of the theory of represented spaces ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ A characterization of computable analysis on unbounded domains using differential equations ⋮ Semantical proofs of correctness for programs performing non-deterministic tests on real numbers ⋮ Unnamed Item ⋮ A refined model of computation for continuous problems ⋮ Computable invariance ⋮ Feasible real random access machines ⋮ 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 ⋮ Decidability in analysis ⋮ A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations ⋮ Admissibly Represented Spaces and Qcb-Spaces ⋮ A Real Number Structure that is Effectively Categorical

Cites Work

• Computational complexity of real functions
• Feasible real random access machines
• Recursion theory on the reals and continuous-time computation
• Computability on computable metric spaces
• Funktional‐Rekursion
• Computable functionals
• On the definitions of computable real continuous functions
• A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
• Berechenbare Reelle Funktionen
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• On the Definition of Computable Function of a Real Variable
• Berechenbare Reelle Funktionenfolgen
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Topologies on Spaces of Subsets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive characterization of computable real-valued functions and relations