Feasible real random access machines

DOI10.1007/BFB0037415zbMATH Open1541.68132MaRDI QIDQ6560189FDOQ6560189

P. H. Hertling, Vasco Brattka

Publication date: 21 June 2024

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)

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Multiple-Precision Evaluation of Elementary Functions
• On the definitions of computable real continuous functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• The real number model in numerical analysis
• Recursive characterization of computable real-valued functions and relations
• On the complexity of online computations of real functions
• 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)