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

DOI10.1016/S0304-3975(97)00177-1zbMATH Open0911.68061MaRDI QIDQ1127553FDOQ1127553

Authors: Corine Ceola, Pierre B. A. Lecomte 

Publication date: 13 August 1998

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

Recommendations

• scientific article; zbMATH DE number 446847
• Publication:3033315
• Noncomputable functions in the Blum-Shub-Smale model
• Publication:4729767

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)

Cites Work

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

Cited In (2)

• Computability of a map and decidability of its graph in the model of Blum, Shub and Smale
• Title not available (Why is that?)

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)