On approximate and algebraic computability over the real numbers

DOI10.1016/S0304-3975(98)00289-8zbMath0916.68054OpenAlexW2078849804MaRDI QIDQ1292404

Armin Hemmerling

Publication date: 21 June 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00289-8

zbMATH Keywords

computable real functioncomputable real numberabstract (algebraic) computabilityapproximate computabilityarithmetical hierarchies over the reals

Mathematics Subject Classification ID

Related Items (4)

The Hausdorff-Ershov hierarchy in Euclidean spaces ⋮ On the time complexity of partial real functions ⋮ Outline of partial computability in computable topology ⋮ Effective metric spaces and representations of the reals.

Cites Work

• 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
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
• Descriptive set theory
• Computational complexity of real functions
• Definability by programs in first-order structures
• \(\delta\)-uniform BSS machines
• Feasible real random access machines
• Computation by `While' programs on topological partial algebras
• Classical recursion theory. Vol. II
• On formalised computer programs
• Alfred Tarski's elimination theory for real closed fields
• The Arithmetical Hierarchy Over the Reals
• Algorithmic Procedures
• On the Definition of Computable Function of a Real Variable
• Computability of String Functions Over Algebraic Structures Armin Hemmerling
• Das Unendliche in Philosophie, Theologie und Mathematik
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Algorithmic properties of structures
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

This page was built for publication: On approximate and algebraic computability over the real numbers