Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine

DOI10.1016/S0304-3975(97)00008-XzbMath0902.68063MaRDI QIDQ1128664

Ning Zhong

Publication date: 13 August 1998

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

zbMATH Keywords

Blum-Shub-smale machineTuring computing model

Mathematics Subject Classification ID

Related Items

A topological view on algebraic computation models, Computing eigenvalues of the Laplacian on rough domains, On Σ‐definability without equality over the real numbers, The Computational Complexity of Some Julia Sets, The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited, \(\delta\)-uniform BSS machines, Computability on subsets of Euclidean space. I: Closed and compact subsets, On approximate and algebraic computability over the real numbers, Computable Geometric Complex Analysis and Complex Dynamics

Cites Work

• Topological complexity of a root finding algorithm
• Computational complexity of real functions
• Computable functionals
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item