Pages that link to "Item:Q1279912"
From MaRDI portal
The following pages link to Feasible real random access machines (Q1279912):
Displaying 18 items.
- Computational complexity of iterated maps on the interval (Q449664) (← links)
- A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
- Stability versus speed in a computable algebraic model (Q817853) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
- The Turing closure of an Archimedean field (Q1575915) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- Arbitrary precision real arithmetic: design and algorithms (Q1779562) (← links)
- Polynomial time over the reals with parsimony (Q2039933) (← links)
- Axiomatic reals and certified efficient exact real computation (Q2148797) (← links)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library (Q2572919) (← links)
- Topological lower bounds on algebraic random access machines (Q2784478) (← links)
- Effectivity and effective continuity of multifunctions (Q3570164) (← links)
- First-Order Universality for Real Programs (Q3576032) (← links)
- Admissibly Represented Spaces and Qcb-Spaces (Q5024575) (← links)
- Computer Science for Continuous Data (Q6487409) (← links)
- Verified exact real computation with nondeterministic functions and limits (Q6546605) (← links)
- Semantics, specification logic, and Hoare logic of exact real computation (Q6563064) (← links)