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

DOI10.1016/S0304-3975(97)00177-1zbMath0911.68061MaRDI QIDQ1127553

Corine Ceola, Pierre B. A. Lecomte

Publication date: 13 August 1998

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

zbMATH Keywords

computation over a ring

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Computability of a map and decidability of its graph in the model of Blum, Shub and Smale
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• A new decision method for elementary algebra
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

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