On approximate and algebraic computability over the real numbers
From MaRDI portal
Publication:1292404
computable real numberabstract (algebraic) computabilityapproximate computabilityarithmetical hierarchies over the realscomputable real function
Recommendations
Cites work
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 3788601 (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 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 192929 (Why is no real title available?)
- scientific article; zbMATH DE number 3577197 (Why is no real title available?)
- scientific article; zbMATH DE number 785052 (Why is no real title available?)
- scientific article; zbMATH DE number 3229496 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3349780 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Alfred Tarski's elimination theory for real closed fields
- Algorithmic Procedures
- Algorithmic properties of structures
- Classical recursion theory. Vol. II
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- Computation by `While' programs on topological partial algebras
- Computational complexity of real functions
- Das Unendliche in Philosophie, Theologie und Mathematik
- Definability by programs in first-order structures
- Descriptive set theory
- Feasible real random access machines
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On formalised computer programs
- On the Definition of Computable Function of a Real Variable
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
- The Arithmetical Hierarchy Over the Reals
- The computable multi-functions on multi-represented sets are closed under programming
- \(\delta\)-uniform BSS machines
Cited in
(17)- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals
- Real number computability and domain theory
- Feasible Real Functions and Arithmetic Circuits
- Logical Approaches to Computational Barriers
- Processes and structures on approximation spaces
- Effective metric spaces and representations of the reals.
- The Hausdorff-Ershov hierarchy in Euclidean spaces
- On the time complexity of partial real functions
- The methods of approximation and lifting in real computation
- Using Approximation to Relate Computational Classes over the Reals
- scientific article; zbMATH DE number 1870419 (Why is no real title available?)
- On logarithmic-space computable real numbers
- The approximation structure of a computably approximable real
- Outline of partial computability in computable topology
- Towards computable analysis on the generalised real line
- A new approach to computability over the reals
- A Differentially Algebraic Replacement Theorem, and Analog Computability
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)
