Decision problems and round-off machines

DOI10.1007/S00224-001-1024-4MaRDI QIDQ5956789zbMATH OpenOpenAlexFDO

Authors Felipe Cucker, Jean-Pierre Dedieu

Publication date 28 February 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-001-1024-4

zbMATH Keywords

decision machines

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1859211
• Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding.
• scientific article; zbMATH DE number 1305086
• \(\delta\)-decidability over the reals
• A theory of complexity, condition, and roundoff

Cited in

(3)

• scientific article; zbMATH DE number 1859211 (Why is no real title available?)
• On some decision problems in programming
• Decision problems for Turing machines

This page was built for publication: Decision problems and round-off machines

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