Feasible real random access machines

DOI10.1007/BFB0037415MaRDI QIDQ6560189zbMATH OpenFDO

Authors Vasco Brattka, P. H. Hertling

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/BFB0037415

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical models of computation (Turing machines, etc.) (68Q04)

Recommendations

• Feasible real random access machines
• Lower bounds on algebraic random access machines
• Topological lower bounds on algebraic random access machines
• scientific article; zbMATH DE number 3850476
• Feasible Real Functions and Arithmetic Circuits

Cites work

• scientific article; zbMATH DE number 3987247 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 193625 (Why is no real title available?)
• scientific article; zbMATH DE number 1003230 (Why is no real title available?)
• Fast Multiple-Precision Evaluation of Elementary Functions
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the complexity of online computations of real functions
• On the definitions of computable real continuous functions
• Recursive characterization of computable real-valued functions and relations
• The real number model in numerical analysis
• Type 2 computational complexity of functions on Cantor's space

This page was built for publication: Feasible real random access machines

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