On approximate and algebraic computability over the real numbers

DOI10.1016/S0304-3975(98)00289-8zbMATH Open0916.68054OpenAlexW2078849804MaRDI QIDQ1292404FDOQ1292404

Authors: 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

Recommendations

• On the Definition of Computable Function of a Real Variable
• Effective metric spaces and representations of the reals.
• A characterization of computable analysis on unbounded domains using differential equations
• New Computational Paradigms
• Automata, Languages and Programming

zbMATH Keywords

computable real numberabstract (algebraic) computabilityapproximate computabilityarithmetical hierarchies over the realscomputable real function

Mathematics Subject Classification ID

Cites Work

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

Cited In (17)

• Title not available (Why is that?)
• Effective metric spaces and representations of the reals.
• On the time complexity of partial real functions
• Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals
• Outline of partial computability in computable topology
• Towards computable analysis on the generalised real line
• Logical Approaches to Computational Barriers
• A new approach to computability over the reals
• Real number computability and domain theory
• Feasible Real Functions and Arithmetic Circuits
• A Differentially Algebraic Replacement Theorem, and Analog Computability
• Processes and structures on approximation spaces
• Using Approximation to Relate Computational Classes over the Reals
• The Hausdorff-Ershov hierarchy in Euclidean spaces
• The approximation structure of a computably approximable real
• The methods of approximation and lifting in real computation
• On logarithmic-space computable real numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292404)