Software testing in computable analysis

DOI10.1007/978-3-031-63742-1_5MaRDI QIDQ7013628zbMATH OpenFDO

Authors Klaus Meer, Martin Ziegler

Publication date 12 March 2025

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites work

• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 2086425 (Why is no real title available?)
• Average-case bit-complexity theory of real functions
• Handbook of model checking
• Introduction to Property Testing
• On promise problems: a survey
• Representing probability measures using probabilistic processes
• Valid Generalisation from Approximate Interpolation

This page was built for publication: Software testing in computable analysis

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