Some initial thoughts on bounded query computations over the reals

DOI10.1142/S0129054112400618zbMATH Open1297.03028OpenAlexW2064335432MaRDI QIDQ4923293FDOQ4923293

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

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

zbMATH Keywords

real number modelbounded queries

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Cites Work

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

Cited In (5)

• TIME BOUNDED COMPUTATIONS OVER THE REALS
• Title not available (Why is that?)
• On Bounded Queries and Approximation
• Finitely bounded effective computability
• Title not available (Why is that?)

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)