On approximate and algebraic computability over the real numbers
type: Item
instance of: scholarly article
title: On approximate and algebraic computability over the real numbers
zbMATH Open document ID: 0916.68054
DOI: 10.1016/S0304-3975(98)00289-8
author: Armin Hemmerling
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1306133
zbMATH Keywords: computable real function
zbMATH Keywords: computable real number
zbMATH Keywords: abstract (algebraic) computability
zbMATH Keywords: approximate computability
zbMATH Keywords: arithmetical hierarchies over the reals
MaRDI profile type: Publication
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: \(\delta\)-uniform BSS machines
cites work: Feasible real random access machines
cites work: The Arithmetical Hierarchy Over the Reals
cites work: Alfred Tarski's elimination theory for real closed fields
cites work: Algorithmic properties of structures
cites work: Q5625129
cites work: Algorithmic Procedures
cites work: Computability of String Functions Over Algebraic Structures Armin Hemmerling
cites work: Das Unendliche in Philosophie, Theologie und Mathematik
cites work: Q4146722
cites work: Q5517672
cites work: Definability by programs in first-order structures
cites work: Q5812175
cites work: Q4002474
cites work: Computational complexity of real functions
cites work: Q3966120
cites work: On formalised computer programs
cites work: Descriptive set theory
cites work: Classical recursion theory. Vol. II
cites work: Q3994907
cites work: Q3992847
cites work: Q5573961
cites work: On the Definition of Computable Function of a Real Variable
cites work: Q5807665
cites work: Q4039815
cites work: Computation by `While' programs on topological partial algebras
cites work: Q4842541
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
cites work: Q3751553
cites work: Q3518432
cites work: Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
full work available at URL: s0304-3975(98)00289-8
OpenAlex ID: W2078849804
description: scientific article; zbMATH DE number 1306133