Some initial thoughts on bounded query computations over the reals

DOI10.1142/S0129054112400618MaRDI QIDQ4923293zbMATH OpenOpenAlexFDO

Authors Klaus Meer

Publication date 6 June 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054112400618

zbMATH Keywords

bounded queriesreal number model

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Recommendations

• Bounded queries in recursion theory
• Noncomputable functions in the Blum-Shub-Smale model
• scientific article; zbMATH DE number 1405575
• TIME BOUNDED COMPUTATIONS OVER THE REALS
• The cardinality of an oracle in Blum-Shub-Smale computation

Cites work

• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
• A note on non-complete problems in \(NP_\mathbb{R}\)
• An explicit solution to Post's problem over the reals
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the Structure of $\cal NP_\Bbb C$
• P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP

Cited in

(5)

• TIME BOUNDED COMPUTATIONS OVER THE REALS
• On Bounded Queries and Approximation
• Finitely bounded effective computability
• scientific article; zbMATH DE number 1418323 (Why is no real title available?)
• scientific article; zbMATH DE number 1424049 (Why is no real title available?)

This page was built for publication: Some initial thoughts on bounded query computations over the reals

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