Pages that link to "Item:Q1279912"
From MaRDI portal
The following pages link to Feasible real random access machines (Q1279912):
Displayed 6 items.
- 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)
- Arbitrary precision real arithmetic: design and algorithms (Q1779562) (← links)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library (Q2572919) (← links)