Decision problems and round-off machines

DOI10.1007/S00224-001-1024-4zbMATH Open0993.68121OpenAlexW2010939262MaRDI QIDQ5956789FDOQ5956789

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

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

zbMATH Keywords

decision machines

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Decision problems for Turing machines
• On some decision problems in programming

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)