Computability of a map and decidability of its graph in the model of Blum, Shub and Smale

DOI10.1016/S0304-3975(97)00177-1MaRDI QIDQ1127553zbMATH OpenFDO

Authors Corine Ceola, Pierre B. A. Lecomte

Publication date 13 August 1998

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

Full work available at URL https://doi.org/10.1016/S0304-3975(97)00177-1

zbMATH Keywords

computation over a ring

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 446847
• scientific article; zbMATH DE number 4131650
• Noncomputable functions in the Blum-Shub-Smale model
• scientific article; zbMATH DE number 4114603

Cites work

• A new decision method for elementary algebra
• Computability of a map and decidability of its graph in the model of Blum, Shub and Smale
• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 3249766 (Why is no real title available?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination

Cited in

(2)

• Computability of a map and decidability of its graph in the model of Blum, Shub and Smale
• scientific article; zbMATH DE number 446847 (Why is no real title available?)

This page was built for publication: Computability of a map and decidability of its graph in the model of Blum, Shub and Smale

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