Recursively enumerable subsets of R^q in two computing models Blum-Shub-Smale machine and Turing machine

DOI10.1016/S0304-3975(97)00008-XzbMATH Open0902.68063MaRDI QIDQ1128664FDOQ1128664

Authors: Ning Zhong 

Publication date: 13 August 1998

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

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

zbMATH Keywords

Blum-Shub-smale machineTuring computing model

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?)
• Topological complexity of a root finding algorithm
• Title not available (Why is that?)
• Computational complexity of real functions
• Computable functionals
• Title not available (Why is that?)

Cited In (12)

• Noncomputable functions in the Blum-Shub-Smale model
• On approximate and algebraic computability over the real numbers
• \(\delta\)-uniform BSS machines
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
• A topological view on algebraic computation models
• Computing eigenvalues of the Laplacian on rough domains
• Computable Geometric Complex Analysis and Complex Dynamics
• On the Characterization of Recursively Enumerable Sets as Pseudo- Diophantine
• The computational complexity of some Julia sets
• On Σ‐definability without equality over the real numbers
• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets

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)