Recursively enumerable subsets of R^q in two computing models Blum-Shub-Smale machine and Turing machine
From MaRDI portal
Publication:1128664
Recommendations
- Noncomputable functions in the Blum-Shub-Smale model
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- A survey on real structural complexity theory
- Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable
Cites work
- Computable functionals
- Computational complexity of real functions
- scientific article; zbMATH DE number 3129325 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 3700811 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 3581219 (Why is no real title available?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Topological complexity of a root finding algorithm
Cited in
(15)- \(\delta\)-uniform BSS machines
- Equality is a jump
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- On approximate and algebraic computability over the real numbers
- Isomorphism theorem for BSS recursively enumerable sets over real closed fields
- A topological view on algebraic computation models
- Noncomputable functions in the Blum-Shub-Smale model
- Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
- On Σ‐definability without equality over the real numbers
- On the Characterization of Recursively Enumerable Sets as Pseudo- Diophantine
- The computational complexity of some Julia sets
- Computable Geometric Complex Analysis and Complex Dynamics
- Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable
- Computing eigenvalues of the Laplacian on rough domains
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
This page was built for publication: Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128664)
